@@ -1,57 +1,133 @@
1−{-# LANGUAGE CPP, ExistentialQuantification, GADTs, ScopedTypeVariables, TypeFamilies, FlexibleInstances, MultiParamTypeClasses, GeneralizedNewtypeDeriving, RankNTypes, BangPatterns, UndecidableInstances, EmptyDataDecls, RecursiveDo, RoleAnnotations, LambdaCase, TypeOperators, FlexibleContexts, ConstraintKinds, MagicHash, UnboxedTuples, FunctionalDependencies #-}
1+{-# LANGUAGE BangPatterns #-}
2−module Reflex.Spider.Internal (Spider, SpiderEnv (..), Global, SpiderHost, runSpiderHost, SpiderEventHandle (..), showSubscriberType, showEventType, ComputeM (..), MergeSubscribedParent (..), HasSpiderEnv (..), newSpiderEnv, SpiderPullM (..), SpiderPushM (..), ReadPhase (..)) where
2+{-# LANGUAGE CPP #-}
3−
3+{-# LANGUAGE ConstraintKinds #-}
4−import qualified Reflex.Class as R
4+{-# LANGUAGE EmptyDataDecls #-}
5−import qualified Reflex.Host.Class as R
5+{-# LANGUAGE ExistentialQuantification #-}
6−import Data.WeakBag (WeakBag, WeakBagTicket)
6+{-# LANGUAGE FlexibleContexts #-}
7−import qualified Data.WeakBag as WeakBag
7+{-# LANGUAGE FlexibleInstances #-}
8+{-# LANGUAGE FunctionalDependencies #-}
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 #-}
24+#ifdef USE_REFLEX_OPTIMIZER
25+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
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
9−import Data.List
32+#if MIN_VERSION_base(4,10,0)
10−import Data.IORef
33+import Control.Applicative (liftA2)
11−import System.Mem.Weak
34+#endif
12−import Data.Foldable
35+import Control.Concurrent
13−import Data.Traversable
36+import Control.Exception
14−import Control.Monad hiding (mapM, mapM_, forM_, forM, sequence)
37+import Control.Monad hiding (forM, forM_, mapM, mapM_)
15−import Control.Monad.Identity hiding (mapM, mapM_, forM_, forM, sequence)
38+import Control.Monad.Exception
39+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
16−import Control.Monad.Reader hiding (mapM, mapM_, forM_, forM, sequence)
40+import Control.Monad.Primitive
41+import Control.Monad.Reader.Class
17−import Control.Monad.State hiding (mapM, mapM_, forM_, forM, sequence)
42+import Control.Monad.IO.Class
18−import Control.Applicative -- Unconditionally import, because otherwise it breaks on GHC 7.10.1RC2
43+import Control.Monad.ReaderIO
19−import Data.Some (Some)
44+import Control.Monad.Ref
45+import Control.Monad.Fail (MonadFail)
20−import qualified Data.Some as Some
46+import qualified Control.Monad.Fail as MonadFail
21−import Data.Dependent.Map (DMap, DSum (..))
49+import Data.Dependent.Map (DMap)
22import qualified Data.Dependent.Map as DMap
50import 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
23import Data.GADT.Compare
58import Data.GADT.Compare
24−import Data.Maybe
59+import Data.IntMap.Strict (IntMap)
25−import Data.IntMap (IntMap)
26−import qualified Data.IntMap as IntMap
60+import qualified Data.IntMap.Strict as IntMap
27−import Control.Monad.Ref
61+import Data.IORef
28−import Control.Monad.Exception
62+import Data.Kind (Type)
63+import Data.Maybe hiding (mapMaybe)
29−import Data.Monoid ((<>))
64+import Data.Monoid (mempty, (<>))
30−import Data.Functor.Compose
65+import Data.Proxy
31−import Control.Exception
32−import Control.Concurrent
34import Data.These
66import Data.These
35−import Data.Align
67+import Data.Traversable
36−
68+import Data.Type.Equality ((:~:)(Refl))
69+import Data.Witherable (Filterable, mapMaybe)
70+import GHC.Exts hiding (toList)
37import GHC.IORef (IORef (..))
71import GHC.IORef (IORef (..))
38−import GHC.Base (IO (..))
39import GHC.Stack
72import GHC.Stack
40−
73+import Reflex.FastWeak
41import System.IO.Unsafe
74import System.IO.Unsafe
75+import System.Mem.Weak
42import Unsafe.Coerce
76import Unsafe.Coerce
44−import Control.Monad.Primitive
46−import qualified Data.List.NonEmpty as NonEmpty
78+#ifdef MIN_VERSION_semialign
79+#if MIN_VERSION_these(0,8,0)
80+import Data.These.Combinators (justThese)
82+#if MIN_VERSION_semialign(1,1,0)
83+import Data.Zip (Zip (..))
88+import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
47import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
91import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
92+import qualified Data.List.NonEmpty as NonEmpty
48−import Data.Tree (Tree (..), Forest, drawForest)
93+import Data.Tree (Forest, Tree (..), drawForest)
94+import Data.List (isPrefixOf)
50−-- Note: must come last to silence warnings due to AMP on GHC < 7.10
96+import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
51−import Prelude hiding (mapM, mapM_, any, sequence, concat)
97+import qualified Data.FastWeakBag as FastWeakBag
53−type SubscriberList a = WeakBag (Subscriber a)
99+import Data.Reflection
54−type SubscriberListTicket a = WeakBagTicket (Subscriber a)
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
110+import qualified Data.Patch.DMapWithMove as PatchDMapWithMove
111+import Reflex.PerformEvent.Base (PerformEventT)
113+#ifdef DEBUG_TRACE_EVENTS
114+import qualified Data.ByteString.Char8 as BS8
115+import System.IO (stderr)
116+import Data.List (isPrefixOf)
119+-- TODO stdout might not be the best channel for debug output
120+debugStrLn :: String -> IO ()
121+debugStrLn = putStrLn
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"
56debugPropagate :: Bool
132debugPropagate :: Bool
@@ -60,52 +136,65 @@ debugInvalidateHeight :: Bool
60debugInvalidate :: Bool
136debugInvalidate :: Bool
62#ifdef DEBUG
138#ifdef DEBUG
64#define DEBUG_NODEIDS
139#define DEBUG_NODEIDS
141+#ifdef DEBUG_TRACE_PROPAGATION
66debugPropagate = True
142debugPropagate = True
144+debugPropagate = False
147+#ifdef DEBUG_TRACE_HEIGHT
148+debugInvalidateHeight = True
68debugInvalidateHeight = False
150debugInvalidateHeight = False
153+#ifdef DEBUG_TRACE_INVALIDATION
70debugInvalidate = True
154debugInvalidate = True
156+debugInvalidate = False
72class HasNodeId a where
159class HasNodeId a where
73 getNodeId :: a -> Int
160 getNodeId :: a -> Int
75−instance HasNodeId (Hold p a) where
162+instance HasNodeId (CacheSubscribed x a) where
76− getNodeId = holdNodeId
163+ getNodeId = _cacheSubscribed_nodeId
78−instance HasNodeId (PushSubscribed a b) where
165+instance HasNodeId (FanInt x a) where
79− getNodeId = pushSubscribedNodeId
166+ getNodeId = _fanInt_nodeId
81−instance HasNodeId (SwitchSubscribed a) where
168+instance HasNodeId (Hold x p) where
82− getNodeId = switchSubscribedNodeId
169+ getNodeId = holdNodeId
84−instance HasNodeId (MergeSubscribed a) where
171+instance HasNodeId (SwitchSubscribed x a) where
85− getNodeId = mergeSubscribedNodeId
172+ getNodeId = switchSubscribedNodeId
87−instance HasNodeId (FanSubscribed a) where
174+instance HasNodeId (FanSubscribed x v a) where
88 getNodeId = fanSubscribedNodeId
175 getNodeId = fanSubscribedNodeId
90−instance HasNodeId (CoincidenceSubscribed a) where
177+instance HasNodeId (CoincidenceSubscribed x a) where
91 getNodeId = coincidenceSubscribedNodeId
178 getNodeId = coincidenceSubscribedNodeId
93−instance HasNodeId (RootSubscribed a) where
180+instance HasNodeId (RootSubscribed x a) where
94 getNodeId = rootSubscribedNodeId
181 getNodeId = rootSubscribedNodeId
96−instance HasNodeId (Pull a) where
183+instance HasNodeId (Pull x a) where
97 getNodeId = pullNodeId
184 getNodeId = pullNodeId
99{-# INLINE showNodeId #-}
186{-# INLINE showNodeId #-}
100showNodeId :: HasNodeId a => a -> String
187showNodeId :: HasNodeId a => a -> String
101−showNodeId = ("#"<>) . show . getNodeId
188+showNodeId = showNodeId' . getNodeId
190+showNodeId' :: Int -> String
191+showNodeId' = ("#"<>) . show
105debugPropagate = False
196debugPropagate = False
107debugInvalidateHeight = False
197debugInvalidateHeight = False
109debugInvalidate = False
198debugInvalidate = False
111-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
200-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -113,6 +202,10 @@ debugInvalidate = False
113showNodeId :: a -> String
202showNodeId :: a -> String
114showNodeId _ = ""
203showNodeId _ = ""
205+{-# INLINE showNodeId' #-}
206+showNodeId' :: Int -> String
118#ifdef DEBUG_NODEIDS
211#ifdef DEBUG_NODEIDS
@@ -122,41 +215,637 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
123newNodeId :: IO Int
216newNodeId :: IO Int
124newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
217newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
220+--------------------------------------------------------------------------------
222+--------------------------------------------------------------------------------
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)
231+unsubscribe :: EventSubscription x -> IO ()
232+unsubscribe (EventSubscription u _) = u
234+--------------------------------------------------------------------------------
236+--------------------------------------------------------------------------------
238+newtype Event x a = Event { unEvent :: Subscriber x a -> EventM x (EventSubscription x, Maybe a) }
240+{-# INLINE subscribeAndRead #-}
241+subscribeAndRead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
242+subscribeAndRead = unEvent
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
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
259+ mapM_ (subscriberPropagate sub) mb
261+ occ' <- join <$> mapM f occ
262+ return (subscription, occ')
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 ()
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
283+ liftIO $ case occ of
284+ Nothing -> writeIORef subscriptionRef $! subscription
285+ Just _ -> unsubscribe subscription
286+ return (subscription, occ)
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)
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
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))
306+ , _cacheSubscribed_nodeId :: {-# UNPACK #-} !Int
310+nowSpiderEventM :: (HasSpiderTimeline x) => EventM x (R.Event (SpiderTimeline x) ())
314+now :: (MonadIO m, Defer (Some Clear) m, HasSpiderTimeline x
317+ nowOrNot <- liftIO $ newIORef $ Just ()
318+ scheduleClear nowOrNot
319+ return . Event $ \_ -> do
320+ occ <- liftIO . readIORef $ nowOrNot
321+ return ( EventSubscription (return ()) eventSubscribedNow
325+-- | Construct an 'Event' whose value is guaranteed not to be recomputed
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
331+{-# NOINLINE [0] cacheEvent #-}
332+cacheEvent :: forall x a. HasSpiderTimeline x => Event x a -> Event x a
334+#ifdef DEBUG_TRACE_EVENTS
335+ withStackOneLine $ \callSite -> Event $
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
346+ subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347+ Just subscribedTicket -> return subscribedTicket
350+ nodeId <- liftIO newNodeId
352+ subscribers <- liftIO FastWeakBag.empty
353+ occRef <- liftIO $ newIORef Nothing -- This should never be read prior to being set below
355+ (parentSub, occ) <- subscribeAndRead e $ debugSubscriber' ("cacheEvent" <> showNodeId' nodeId) $ Subscriber
357+ (parentSub, occ) <- subscribeAndRead e $ Subscriber
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
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
374+ , _cacheSubscribed_nodeId = nodeId
377+ subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378+ liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379+ return subscribedTicket
380+ liftIO $ cacheSubscription sub mSubscribedRef subscribedTicket
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
389+ let parentSub = _cacheSubscribed_parent subscribed
390+ es = EventSubscription
391+ { _eventSubscription_unsubscribe = do
392+ FastWeakBag.remove ticket
394+ isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
396+ writeIORef mSubscribedRef emptyFastWeak
397+ unsubscribe parentSub
399+ touch subscribedTicket
400+ , _eventSubscription_subscribed = EventSubscribed
401+ { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub
402+ , eventSubscribedRetained = toAny subscribedTicket
404+ , eventSubscribedGetParents = return [_eventSubscription_subscribed parentSub]
405+ , eventSubscribedHasOwnHeightRef = False
406+ , eventSubscribedWhoCreated = whoCreatedIORef mSubscribedRef
413+subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
414+subscribe e s = fst <$> subscribeAndRead e s
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
421+ return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
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
426+subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427+subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
429+eventNever :: Event x a
430+eventNever = Event $ const subscribeAndReadNever
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
435+eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
436+eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
438+eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
439+eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
441+eventHold :: Hold x p -> Event x p
442+eventHold !h = Event $ subscribeHoldEvent h
126−{-# NOINLINE unsafeNodeId #-}
444+eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
127−unsafeNodeId :: a -> Int
445+eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
128−unsafeNodeId a = unsafePerformIO $ do
446+
129− touch a
447+{-# INLINE subscribeCoincidenceInner #-}
130− newNodeId
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)
457+--------------------------------------------------------------------------------
459+--------------------------------------------------------------------------------
461+data Subscriber x a = Subscriber
462+ { subscriberPropagate :: !(a -> EventM x ())
463+ , subscriberInvalidateHeight :: !(Height -> IO ())
464+ , subscriberRecalculateHeight :: !(Height -> IO ())
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 ()
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_
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
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)
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
517+ liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518+ scheduleClear $ coincidenceSubscribedInnerParent subscribed
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
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
538+ Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
540+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
541+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
542+ propagate a $ coincidenceSubscribedSubscribers subscribed
543+ , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544+ , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
547+invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
548+invalidateSubscriberHeight = flip subscriberInvalidateHeight
550+recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551+recalculateSubscriberHeight = flip subscriberRecalculateHeight
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
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
567+--------------------------------------------------------------------------------
569+--------------------------------------------------------------------------------
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
579+data EventSubscribed x = EventSubscribed
580+ { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581+ , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
583+ , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
584+ , eventSubscribedHasOwnHeightRef :: !Bool
585+ , eventSubscribedWhoCreated :: !(IO [String])
589+eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x
590+eventSubscribedRoot !r = EventSubscribed
591+ { eventSubscribedHeightRef = zeroRef
592+ , eventSubscribedRetained = toAny r
594+ , eventSubscribedGetParents = return []
595+ , eventSubscribedHasOwnHeightRef = False
596+ , eventSubscribedWhoCreated = return ["root"]
600+eventSubscribedNever :: EventSubscribed x
601+eventSubscribedNever = EventSubscribed
602+ { eventSubscribedHeightRef = zeroRef
603+ , eventSubscribedRetained = toAny ()
605+ , eventSubscribedGetParents = return []
606+ , eventSubscribedHasOwnHeightRef = False
607+ , eventSubscribedWhoCreated = return ["never"]
610+eventSubscribedNow :: EventSubscribed x
611+eventSubscribedNow = EventSubscribed
612+ { eventSubscribedHeightRef = zeroRef
613+ , eventSubscribedRetained = toAny ()
615+ , eventSubscribedGetParents = return []
616+ , eventSubscribedHasOwnHeightRef = False
617+ , eventSubscribedWhoCreated = return ["now"]
621+eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
622+eventSubscribedFan !subscribed = EventSubscribed
623+ { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624+ , eventSubscribedRetained = toAny subscribed
626+ , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
627+ , eventSubscribedHasOwnHeightRef = False
628+ , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
632+eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x
633+eventSubscribedSwitch !subscribed = EventSubscribed
634+ { eventSubscribedHeightRef = switchSubscribedHeight subscribed
635+ , eventSubscribedRetained = toAny subscribed
637+ , eventSubscribedGetParents = do
638+ s <- readIORef $ switchSubscribedCurrentParent subscribed
639+ return [_eventSubscription_subscribed s]
640+ , eventSubscribedHasOwnHeightRef = True
641+ , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
645+eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x
646+eventSubscribedCoincidence !subscribed = EventSubscribed
647+ { eventSubscribedHeightRef = coincidenceSubscribedHeight subscribed
648+ , eventSubscribedRetained = toAny subscribed
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
660+getEventSubscribedHeight :: EventSubscribed x -> IO Height
661+getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
664+whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
665+whoCreatedEventSubscribed = eventSubscribedWhoCreated
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
674+ mapM_ loop =<< liftIO (eventSubscribedGetParents s)
675+ forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
133−--TODO: Figure out why certain things are not 'representational', then make them representational so we can use coerce
679+{-# INLINE subscribeHoldEvent #-}
680+subscribeHoldEvent :: Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
681+subscribeHoldEvent = subscribeAndRead . holdEvent
683+--------------------------------------------------------------------------------
685+--------------------------------------------------------------------------------
687+newtype Behavior x a = Behavior { readBehaviorTracked :: BehaviorM x a }
689+behaviorHold :: Hold x p -> Behavior x (PatchTarget p)
690+behaviorHold !h = Behavior $ readHoldTracked h
692+behaviorHoldIdentity :: Hold x (Identity a) -> Behavior x a
693+behaviorHoldIdentity = behaviorHold
695+behaviorConst :: a -> Behavior x a
696+behaviorConst !a = Behavior $ return a
698+behaviorPull :: Pull x a -> Behavior x a
699+behaviorPull !p = Behavior $ do
700+ val <- liftIO $ readIORef $ pullValue p
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
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
721+ liftIO $ writeIORef (pullValue p) $ Just subscribed
722+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
725+behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
726+behaviorDyn !d = Behavior $ readHoldTracked =<< getDynHold d
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
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
743+--------------------------------------------------------------------------------
745+--------------------------------------------------------------------------------
747+type DynamicS x p = Dynamic x (PatchTarget p) p
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`?
754+deriving instance (HasSpiderTimeline x) => Functor (Dynamic x target)
759+dynamicHold :: Hold x p -> DynamicS x p
760+dynamicHold !h = Dynamic
761+ { dynamicCurrent = behaviorHold h
762+ , dynamicUpdated = eventHold h
765+dynamicHoldIdentity :: Hold x (Identity a) -> DynamicS x (Identity a)
766+dynamicHoldIdentity = dynamicHold
768+dynamicConst :: PatchTarget p -> DynamicS x p
769+dynamicConst !a = Dynamic
770+ { dynamicCurrent = behaviorConst a
771+ , dynamicUpdated = eventNever
774+dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> DynamicS x p
775+dynamicDyn !d = Dynamic
776+ { dynamicCurrent = behaviorDyn d
777+ , dynamicUpdated = eventDyn d
780+dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> DynamicS x (Identity a)
781+dynamicDynIdentity = dynamicDyn
783+--------------------------------------------------------------------------------
785+--------------------------------------------------------------------------------
134--type role Hold representational
787--type role Hold representational
135−data Hold p a
788+data Hold x p
136− = Hold { holdValue :: !(IORef a)
789+ = Hold { holdValue :: !(IORef (PatchTarget p))
137− , holdInvalidators :: !(IORef [Weak Invalidator])
790+ , holdInvalidators :: !(IORef [Weak (Invalidator x)])
791+ , holdEvent :: Event x p -- This must be lazy, or holds cannot be defined before their input Events
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
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
139#ifdef DEBUG_NODEIDS
793#ifdef DEBUG_NODEIDS
140 , holdNodeId :: Int
794 , holdNodeId :: Int
798+-- | A statically allocated 'SpiderTimeline'
801+{-# NOINLINE globalSpiderTimelineEnv #-}
802+globalSpiderTimelineEnv :: SpiderTimelineEnv Global
803+globalSpiderTimelineEnv = unsafePerformIO unsafeNewSpiderTimelineEnv
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
812+data SpiderTimelineEnv' x = SpiderTimelineEnv
813+ { _spiderTimeline_lock :: {-# UNPACK #-} !(MVar ())
814+ , _spiderTimeline_eventEnv :: {-# UNPACK #-} !(EventEnv x)
816+ , _spiderTimeline_depth :: {-# UNPACK #-} !(IORef Int)
819+type role SpiderTimelineEnv' phantom
821+instance Eq (SpiderTimelineEnv x) where
822+ _ == _ = True -- Since only one exists of each type
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
144data EventEnv x
829data EventEnv x
145− = EventEnv { eventEnvSpiderEnv :: !(SpiderEnv x)
146− , eventEnvAssignments :: !(IORef [SomeAssignment]) -- Needed for Subscribe
830+ = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
147− , eventEnvHoldInits :: !(IORef [SomeHoldInit]) -- Needed for Subscribe
831+ , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
832+ , eventEnvDynInits :: !(IORef [SomeDynInit x])
148− , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate])
833+ , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
149− , eventEnvMergeInits :: !(IORef [SomeMergeInit]) -- Needed for Subscribe
834+ , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
150− , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
835+ , eventEnvClears :: !(IORef [Some Clear]) -- Needed for Subscribe
836+ , eventEnvIntClears :: !(IORef [Some IntClear])
151− , eventEnvRootClears :: !(IORef [SomeRootClear])
837+ , eventEnvRootClears :: !(IORef [Some RootClear])
152 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
838 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
153− , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence]) -- Needed for Subscribe
839+ , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
154− , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge]))
840+ , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
157{-# INLINE runEventM #-}
843{-# INLINE runEventM #-}
158−runEventM :: EventM x a -> EventEnv x -> IO a
844+runEventM :: EventM x a -> IO a
159−runEventM = runReaderT . unEventM
845+runEventM = unEventM
847+asksEventEnv :: forall x a. HasSpiderTimeline x => (EventEnv x -> a) -> EventM x a
848+asksEventEnv f = return $ f $ _spiderTimeline_eventEnv (unSTE (spiderTimeline :: SpiderTimelineEnv x))
161class MonadIO m => Defer a m where
850class MonadIO m => Defer a m where
162 getDeferralQueue :: m (IORef [a])
851 getDeferralQueue :: m (IORef [a])
@@ -167,90 +856,98 @@ defer a = do
167 q <- getDeferralQueue
856 q <- getDeferralQueue
168 liftIO $ modifyIORef' q (a:)
857 liftIO $ modifyIORef' q (a:)
170−instance Defer SomeAssignment (EventM x) where
859+instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
860+ {-# INLINE getDeferralQueue #-}
861+ getDeferralQueue = asksEventEnv eventEnvAssignments
863+instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
171 {-# INLINE getDeferralQueue #-}
864 {-# INLINE getDeferralQueue #-}
172− getDeferralQueue = EventM $ asks eventEnvAssignments
865+ getDeferralQueue = asksEventEnv eventEnvHoldInits
174−instance Defer SomeHoldInit (EventM x) where
867+instance HasSpiderTimeline x => Defer (SomeDynInit x) (EventM x) where
175 {-# INLINE getDeferralQueue #-}
868 {-# INLINE getDeferralQueue #-}
176− getDeferralQueue = EventM $ asks eventEnvHoldInits
869+ getDeferralQueue = asksEventEnv eventEnvDynInits
178−instance Defer SomeHoldInit BehaviorM where
871+instance Defer (SomeHoldInit x) (BehaviorM x) where
179 {-# INLINE getDeferralQueue #-}
872 {-# INLINE getDeferralQueue #-}
180 getDeferralQueue = BehaviorM $ asks snd
873 getDeferralQueue = BehaviorM $ asks snd
182−instance Defer SomeMergeUpdate (EventM x) where
875+instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
183 {-# INLINE getDeferralQueue #-}
876 {-# INLINE getDeferralQueue #-}
184− getDeferralQueue = EventM $ asks eventEnvMergeUpdates
877+ getDeferralQueue = asksEventEnv eventEnvMergeUpdates
186−instance Defer SomeMergeInit (EventM x) where
879+instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
187 {-# INLINE getDeferralQueue #-}
880 {-# INLINE getDeferralQueue #-}
188− getDeferralQueue = EventM $ asks eventEnvMergeInits
881+ getDeferralQueue = asksEventEnv eventEnvMergeInits
190−class HasCurrentHeight m where
883+class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
191 getCurrentHeight :: m Height
884 getCurrentHeight :: m Height
192− scheduleMerge :: Height -> MergeSubscribed a -> m ()
885+ scheduleMerge :: Height -> EventM x () -> m ()
194−instance HasCurrentHeight (EventM x) where
887+instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
195 {-# INLINE getCurrentHeight #-}
888 {-# INLINE getCurrentHeight #-}
196− getCurrentHeight = EventM $ do
889+ getCurrentHeight = do
197− heightRef <- asks eventEnvCurrentHeight
890+ heightRef <- asksEventEnv eventEnvCurrentHeight
198 liftIO $ readIORef heightRef
891 liftIO $ readIORef heightRef
199 {-# INLINE scheduleMerge #-}
892 {-# INLINE scheduleMerge #-}
200− scheduleMerge height subscribed = EventM $ do
893+ scheduleMerge height subscribed = do
201− delayedRef <- asks eventEnvDelayedMerges
894+ delayedRef <- asksEventEnv eventEnvDelayedMerges
202− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
895+ liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
204−class HasSpiderEnv x m | m -> x where
897+class HasSpiderTimeline x where
205− askSpiderEnv :: m (SpiderEnv x)
898+ -- | Retrieve the current SpiderTimelineEnv
899+ spiderTimeline :: SpiderTimelineEnv x
207−instance HasSpiderEnv x (EventM x) where
901+instance HasSpiderTimeline Global where
208− {-# INLINE askSpiderEnv #-}
902+ spiderTimeline = globalSpiderTimelineEnv
209− askSpiderEnv = EventM $ asks eventEnvSpiderEnv
211−instance HasSpiderEnv x (SpiderHost x) where
904+putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
212− {-# INLINE askSpiderEnv #-}
905+putCurrentHeight h = do
213− askSpiderEnv = SpiderHost ask
906+ heightRef <- asksEventEnv eventEnvCurrentHeight
907+ liftIO $ writeIORef heightRef $! h
215−putCurrentHeight :: Height -> EventM x ()
216−putCurrentHeight h = EventM $ do
217− heightRef <- asks eventEnvCurrentHeight
218− liftIO $ writeIORef heightRef h
220−instance Defer SomeClear (EventM x) where
909+instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
221 {-# INLINE getDeferralQueue #-}
910 {-# INLINE getDeferralQueue #-}
222− getDeferralQueue = EventM $ asks eventEnvClears
911+ getDeferralQueue = asksEventEnv eventEnvClears
224{-# INLINE scheduleClear #-}
913{-# INLINE scheduleClear #-}
225−scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
914+scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
226−scheduleClear r = defer $ SomeClear r
915+scheduleClear r = defer $ Some $ Clear r
228−instance Defer SomeRootClear (EventM x) where
917+instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
229 {-# INLINE getDeferralQueue #-}
918 {-# INLINE getDeferralQueue #-}
919+ getDeferralQueue = asksEventEnv eventEnvIntClears
921+{-# INLINE scheduleIntClear #-}
922+scheduleIntClear :: Defer (Some IntClear) m => IORef (IntMap a) -> m ()
923+scheduleIntClear r = defer $ Some $ IntClear r
925+instance HasSpiderTimeline x => Defer (Some RootClear) (EventM x) where
926+ {-# INLINE getDeferralQueue #-}
230− getDeferralQueue = EventM $ asks eventEnvRootClears
927+ getDeferralQueue = asksEventEnv eventEnvRootClears
232{-# INLINE scheduleRootClear #-}
929{-# INLINE scheduleRootClear #-}
233−scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
930+scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
234−scheduleRootClear r = defer $ SomeRootClear r
931+scheduleRootClear r = defer $ Some $ RootClear r
236−instance Defer SomeResetCoincidence (EventM x) where
933+instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
237 {-# INLINE getDeferralQueue #-}
934 {-# INLINE getDeferralQueue #-}
238− getDeferralQueue = EventM $ asks eventEnvResetCoincidences
935+ getDeferralQueue = asksEventEnv eventEnvResetCoincidences
240-- Note: hold cannot examine its event until after the phase is over
937-- Note: hold cannot examine its event until after the phase is over
241−{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> EventM x (Hold p a) #-}
938+{-# INLINE [1] hold #-}
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)
939+hold :: (Patch p, Defer (SomeHoldInit x) m) => PatchTarget p -> Event x p -> m (Hold x p)
244hold v0 e = do
940hold v0 e = do
245 valRef <- liftIO $ newIORef v0
941 valRef <- liftIO $ newIORef v0
246 invsRef <- liftIO $ newIORef []
942 invsRef <- liftIO $ newIORef []
247− parentRef <- liftIO $ newIORef $ Left e
943+ parentRef <- liftIO $ newIORef Nothing
248#ifdef DEBUG_NODEIDS
944#ifdef DEBUG_NODEIDS
249 nodeId <- liftIO newNodeId
945 nodeId <- liftIO newNodeId
251 let h = Hold
947 let h = Hold
252 { holdValue = valRef
948 { holdValue = valRef
253 , holdInvalidators = invsRef
949 , holdInvalidators = invsRef
254 , holdParent = parentRef
951 , holdParent = parentRef
255#ifdef DEBUG_NODEIDS
952#ifdef DEBUG_NODEIDS
256 , holdNodeId = nodeId
953 , holdNodeId = nodeId
@@ -259,508 +956,343 @@ hold v0 e = do
259 defer $ SomeHoldInit h
956 defer $ SomeHoldInit h
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 #)
268{-# INLINE getHoldEventSubscription #-}
959{-# INLINE getHoldEventSubscription #-}
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))
960+getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
270getHoldEventSubscription h = do
961getHoldEventSubscription h = do
271 ep <- liftIO $ readIORef $ holdParent h
962 ep <- liftIO $ readIORef $ holdParent h
272 case ep of
963 case ep of
273− Right subd -> return subd
964+ Just subd -> return subd
274− Left e -> do
965+ Nothing -> do
275 subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
967 subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
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, ())
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
290− subscription@(_, subd) <- subscribe e =<< liftIO (newSubscriberHold h)
968+ (subscription@(EventSubscription _ _), occ) <- subscribeAndRead e =<< liftIO (newSubscriberHold h)
291− liftIO $ writeIORef subscriptionRef subscription
969+ liftIO $ writeIORef subscriptionRef $! subscription
292− occ <- liftIO $ readEventSubscribed subd
293 case occ of
970 case occ of
294 Nothing -> return ()
971 Nothing -> return ()
295 Just o -> do
972 Just o -> do
296 old <- liftIO $ readIORef $ holdValue h
973 old <- liftIO $ readIORef $ holdValue h
297− case R.apply o old of
974+ case apply o old of
298 Nothing -> return ()
975 Nothing -> return ()
299 Just new -> do
976 Just new -> do
300 -- Need to evaluate these so that we don't retain the Hold itself
977 -- Need to evaluate these so that we don't retain the Hold itself
301 v <- liftIO $ evaluate $ holdValue h
978 v <- liftIO $ evaluate $ holdValue h
302 i <- liftIO $ evaluate $ holdInvalidators h
979 i <- liftIO $ evaluate $ holdInvalidators h
303 defer $ SomeAssignment v i new
980 defer $ SomeAssignment v i new
304− liftIO $ writeIORef (holdParent h) $ Right subscription
981+ liftIO $ writeIORef (holdParent h) $ Just subscription
305 return subscription
982 return subscription
307−type BehaviorEnv = (Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]), IORef [SomeHoldInit])
984+type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
309−--type role BehaviorM representational
310-- BehaviorM can sample behaviors
986-- BehaviorM can sample behaviors
311−newtype BehaviorM a = BehaviorM { unBehaviorM :: ReaderT BehaviorEnv IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
987+newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988+ deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
313−instance Monad BehaviorM where
990+instance Monad (BehaviorM x) where
314 {-# INLINE (>>=) #-}
991 {-# INLINE (>>=) #-}
315 BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
992 BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
316 {-# INLINE (>>) #-}
993 {-# INLINE (>>) #-}
317 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
994 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
318 {-# INLINE return #-}
995 {-# INLINE return #-}
319 return x = BehaviorM $ return x
996 return x = BehaviorM $ return x
997+#if !MIN_VERSION_base(4,13,0)
320 {-# INLINE fail #-}
998 {-# INLINE fail #-}
321 fail s = BehaviorM $ fail s
999 fail s = BehaviorM $ fail s
323−data BehaviorSubscribed a
1002+data BehaviorSubscribed x a
324− = forall p. BehaviorSubscribedHold (Hold p a)
1003+ = forall p. BehaviorSubscribedHold (Hold x p)
325− | BehaviorSubscribedPull (PullSubscribed a)
1004+ | BehaviorSubscribedPull (PullSubscribed x a)
327−data SomeBehaviorSubscribed = forall a. SomeBehaviorSubscribed (BehaviorSubscribed a)
1006+newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
329--type role PullSubscribed representational
1008--type role PullSubscribed representational
330−data PullSubscribed a
1009+data PullSubscribed x a
331 = PullSubscribed { pullSubscribedValue :: !a
1010 = PullSubscribed { pullSubscribedValue :: !a
332− , pullSubscribedInvalidators :: !(IORef [Weak Invalidator])
1011+ , pullSubscribedInvalidators :: !(IORef [Weak (Invalidator x)])
333− , pullSubscribedOwnInvalidator :: !Invalidator
1012+ , pullSubscribedOwnInvalidator :: !(Invalidator x)
334− , pullSubscribedParents :: ![SomeBehaviorSubscribed] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
1013+ , pullSubscribedParents :: ![SomeBehaviorSubscribed x] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
337--type role Pull representational
1016--type role Pull representational
338−data Pull a
1017+data Pull x a
339− = Pull { pullValue :: !(IORef (Maybe (PullSubscribed a)))
1018+ = Pull { pullValue :: !(IORef (Maybe (PullSubscribed x a)))
340− , pullCompute :: !(BehaviorM a)
1019+ , pullCompute :: !(BehaviorM x a)
341#ifdef DEBUG_NODEIDS
1020#ifdef DEBUG_NODEIDS
342 , pullNodeId :: Int
1021 , pullNodeId :: Int
346−data Invalidator
1025+data Invalidator x
347− = forall a. InvalidatorPull (Pull a)
1026+ = forall a. InvalidatorPull (Pull x a)
348− | forall a. InvalidatorSwitch (SwitchSubscribed a)
1027+ | forall a. InvalidatorSwitch (SwitchSubscribed x a)
350−data RootSubscribed a = forall k. GCompare k => RootSubscribed
1029+data RootSubscribed x a = forall k. GCompare k => RootSubscribed
351 { rootSubscribedKey :: !(k a)
1030 { rootSubscribedKey :: !(k a)
352− , rootSubscribedCachedSubscribed :: !(IORef (DMap k RootSubscribed)) -- From the original Root
1031+ , rootSubscribedCachedSubscribed :: !(IORef (DMap k (RootSubscribed x))) -- From the original Root
353− , rootSubscribedSubscribers :: !(SubscriberList a)
1032+ , rootSubscribedSubscribers :: !(WeakBag (Subscriber x a))
354 , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
1033 , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
355 , rootSubscribedUninit :: IO ()
1034 , rootSubscribedUninit :: IO ()
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?
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?
357#ifdef DEBUG_NODEIDS
1036#ifdef DEBUG_NODEIDS
358 , rootSubscribedNodeId :: Int
1037 , rootSubscribedNodeId :: Int
362−data Root (k :: * -> *)
1041+data Root x k
363 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
1042 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
364− , rootSubscribed :: !(IORef (DMap k RootSubscribed))
1043+ , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
365− , rootInit :: !(forall a. k a -> RootTrigger a -> IO (IO ()))
1044+ , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
368−data SomeHoldInit = forall p a. R.Patch p => SomeHoldInit !(Hold p a)
1047+data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
370−data SomeMergeUpdate = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap (DMap k Event)) (MergeSubscribed k)
1049+data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
372−data SomeMergeInit = forall k. GCompare k => SomeMergeInit !(MergeSubscribed k) !(Event (R.PatchDMap (DMap k Event)))
1051+data SomeMergeUpdate x = SomeMergeUpdate
1052+ { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
1053+ , _someMergeUpdate_invalidateHeight :: !(IO ())
1054+ , _someMergeUpdate_recalculateHeight :: !(IO ())
374−data SomeEventSubscription = forall a. SomeEventSubscription (EventSubscription a)
1057+newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
376-- EventM can do everything BehaviorM can, plus create holds
1059-- EventM can do everything BehaviorM can, plus create holds
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
1060+newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
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)
388− , pushSubscribedNodeId :: Int
392−newtype ComputeM a = ComputeM { unComputeM :: ReaderT (IORef [SomeHoldInit]) IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1062+newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
394−instance Defer SomeHoldInit ComputeM where
1064+data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
395− getDeferralQueue = ComputeM ask
1065+ { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
1066+ , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
397−{-# SPECIALIZE runComputeM :: ComputeM a -> EventM x a #-}
1069+data HeightBag = HeightBag
398−runComputeM :: Defer SomeHoldInit m => ComputeM a -> m a
1070+ { _heightBag_size :: {-# UNPACK #-} !Int
399−runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
1071+ , _heightBag_contents :: !(IntMap Word) -- Number of excess in each bucket
1073+ deriving (Show, Read, Eq, Ord)
401−data Push a b
1075+heightBagEmpty :: HeightBag
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?)
1076+heightBagEmpty = heightBagVerify $ HeightBag 0 IntMap.empty
403− , pushParent :: !(Event a)
404− , pushSubscribed :: !(IORef (Maybe (PushSubscribed a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
407−data MergeSubscribedParent k a
1078+heightBagSize :: HeightBag -> Int
408− = MergeSubscribedParent { mergeSubscribedParentSubscription :: !(EventSubscription a)
1079+heightBagSize = _heightBag_size
409− , mergeSubscribedParentSubscriber :: !(Subscriber a)
412−data MergeSubscribed k
1081+heightBagFromList :: [Height] -> HeightBag
413− = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed k))) -- From the original merge
1082+heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
414− , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
1083+
415− , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
1084+heightBagAdd :: Height -> HeightBag -> HeightBag
416− , mergeSubscribedHeight :: !(IORef Height)
1085+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
417− , mergeSubscribedSubscribers :: !(SubscriberList (DMap k Identity))
1086+ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
418− , mergeSubscribedChange :: !(IORef (Subscriber (R.PatchDMap (DMap k Event)), EventSubscribed (R.PatchDMap (DMap k Event))))
1087+
419− , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent k)))
1088+heightBagRemove :: Height -> HeightBag -> HeightBag
420− , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed k)))
1089+heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
421−#ifdef DEBUG_NODEIDS
1090+ Nothing -> error $ "heightBagRemove: Height " <> show h <> " not present in bag " <> show b
422− , mergeSubscribedNodeId :: Int
1091+ Just old -> HeightBag (pred s) $ case old of
423−#endif
1092+ 0 -> IntMap.delete h c
424− }
1093+ _ -> IntMap.insert h (pred old) c
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
426−--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
428− = Merge { mergeParents :: !(Dynamic R.PatchDMap (DMap k Event))
429− , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed k)))
1102+heightBagMax :: HeightBag -> Height
1103+heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
1104+ Just ((h, _), _) -> Height h
1105+ Nothing -> zeroHeight
1107+heightBagVerify :: HeightBag -> HeightBag
1109+heightBagVerify b@(HeightBag s c) = if
1110+ | s /= IntMap.size c + fromIntegral (sum (IntMap.elems c))
1111+ -> error $ "heightBagVerify: size doesn't match: " <> show b
1112+ | unHeight invalidHeight `IntMap.member` c
1113+ -> error $ "heightBagVerify: contains invalid height: " <> show b
1116+heightBagVerify = id
432−data FanSubscribedChildren k a = FanSubscribedChildren
1119+data FanSubscribedChildren x k v a = FanSubscribedChildren
433− { _fanSubscribedChildren_list :: !(SubscriberList a)
1120+ { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x (v a)))
1121+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k v)
434− , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed k)))
1122+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k v)))
437−data FanSubscribed k
1125+data FanSubscribed x k v
438− = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed k)))
1126+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
1127+ , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k v)))
439− , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren k))) -- This DMap should never be empty
1128+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k v))) -- This DMap should never be empty
440− , fanSubscribedParent :: !(EventSubscription (DMap k Identity))
1129+ , fanSubscribedParent :: !(EventSubscription x)
441#ifdef DEBUG_NODEIDS
1130#ifdef DEBUG_NODEIDS
442 , fanSubscribedNodeId :: Int
1131 , fanSubscribedNodeId :: Int
446−data Fan k
1135+data Fan x k v
447− = Fan { fanParent :: !(Event (DMap k Identity))
1136+ = Fan { fanParent :: !(Event x (DMap k v))
448− , fanSubscribed :: !(IORef (Maybe (FanSubscribed k)))
1137+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
451−data SwitchSubscribed a
1140+data SwitchSubscribed x a
452− = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1141+ = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
453 , switchSubscribedOccurrence :: !(IORef (Maybe a))
1142 , switchSubscribedOccurrence :: !(IORef (Maybe a))
454 , switchSubscribedHeight :: !(IORef Height)
1143 , switchSubscribedHeight :: !(IORef Height)
455− , switchSubscribedSubscribers :: !(SubscriberList a)
1144+ , switchSubscribedSubscribers :: !(WeakBag (Subscriber x a))
456− , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !Invalidator
1145+ , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !(Invalidator x)
457− , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak Invalidator))
1146+ , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak (Invalidator x)))
458− , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed])
1147+ , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed x])
459− , switchSubscribedParent :: !(Behavior (Event a))
1148+ , switchSubscribedParent :: !(Behavior x (Event x a))
460− , switchSubscribedCurrentParent :: !(IORef (EventSubscription a))
1149+ , switchSubscribedCurrentParent :: !(IORef (EventSubscription x))
461− , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed a)))
1150+ , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed x a)))
462#ifdef DEBUG_NODEIDS
1151#ifdef DEBUG_NODEIDS
463 , switchSubscribedNodeId :: Int
1152 , switchSubscribedNodeId :: Int
467−data Switch a
1156+data Switch x a
468− = Switch { switchParent :: !(Behavior (Event a))
1157+ = Switch { switchParent :: !(Behavior x (Event x a))
469− , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1158+ , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
1161+#ifdef USE_TEMPLATE_HASKELL
1162+{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
472−data CoincidenceSubscribed a
1164+data CoincidenceSubscribed x a
473− = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1165+ = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
474 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
1166 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
475− , coincidenceSubscribedSubscribers :: !(SubscriberList a)
1167+ , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
476 , coincidenceSubscribedHeight :: !(IORef Height)
1168 , coincidenceSubscribedHeight :: !(IORef Height)
477− , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber (Event a))
1169+ , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber x (Event x a))
478− , coincidenceSubscribedOuterParent :: !(EventSubscription (Event a))
1170+ , coincidenceSubscribedOuterParent :: !(EventSubscription x)
479− , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed a)))
1171+ , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x)))
480− , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed a)))
1172+ , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed x a)))
481#ifdef DEBUG_NODEIDS
1173#ifdef DEBUG_NODEIDS
482 , coincidenceSubscribedNodeId :: Int
1174 , coincidenceSubscribedNodeId :: Int
486−data Coincidence a
1178+data Coincidence x a
487− = Coincidence { coincidenceParent :: !(Event (Event a))
1179+ = Coincidence { coincidenceParent :: !(Event x (Event x a))
488− , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1180+ , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
491−data Subscriber a
1183+{-# NOINLINE newInvalidatorSwitch #-}
492− = forall b. SubscriberPush (a -> ComputeM (Maybe b)) (PushSubscribed a b) --TODO: Why does this have the pushCompute in it?
1184+newInvalidatorSwitch :: SwitchSubscribed x a -> IO (Invalidator x)
493− | forall k. GCompare k => SubscriberMerge !(k a) (MergeSubscribed k) --TODO: Can we inline the GCompare?
1185+newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
494− | forall k. (a ~ R.PatchDMap (DMap k Event), GCompare k) => SubscriberMergeChange (MergeSubscribed k)
495− | forall k. (GCompare k, a ~ DMap k Identity) => SubscriberFan (FanSubscribed k)
496− | forall p b. (a ~ p b, R.Patch p) => SubscriberHold !(Hold p b)
497− | forall b. (a ~ Identity b) => SubscriberHoldIdentity !(Hold Identity b)
498− | SubscriberSwitch (SwitchSubscribed a)
499− | forall b. a ~ Event b => SubscriberCoincidenceOuter (CoincidenceSubscribed b)
500− | SubscriberCoincidenceInner (CoincidenceSubscribed a)
503−showSubscriberType :: Subscriber a -> String
504−showSubscriberType = \case
505− SubscriberPush _ _ -> "SubscriberPush"
506− SubscriberMerge _ _ -> "SubscriberMerge"
507− SubscriberFan _ -> "SubscriberFan"
508− SubscriberMergeChange _ -> "SubscriberMergeChange"
509− SubscriberHold _ -> "SubscriberHold"
510− SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
511− SubscriberSwitch _ -> "SubscriberSwitch"
512− SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
513− SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
514− SubscriberHandle -> "SubscriberHandle"
517− = forall k. GCompare k => EventRoot !(k a) !(Root k)
519− | forall b. EventPush !(Push b a)
520− | forall k. (GCompare k, a ~ DMap k Identity) => EventMerge !(Merge k)
521− | forall k. GCompare k => EventFan !(k a) !(Fan k)
522− | EventSwitch !(Switch a)
523− | EventCoincidence !(Coincidence a)
524− | forall p b. (a ~ p b, R.Patch p) => EventHold !(Hold p b)
525− | forall p b. (a ~ p b, R.Patch p) => EventDyn !(Dyn p b)
526− | forall b. (a ~ Identity b) => EventHoldIdentity !(Hold Identity b)
527− | forall b. (a ~ Identity b) => EventDynIdentity !(Dyn Identity b)
529−showEventType :: Event a -> String
530−showEventType = \case
531− EventRoot _ _ -> "EventRoot"
532− EventNever -> "EventNever"
533− EventPush _ -> "EventPush"
534− EventMerge _ -> "EventMerge"
535− EventFan _ _ -> "EventFan"
536− EventSwitch _ -> "EventSwitch"
537− EventCoincidence _ -> "EventCoincidence"
538− EventHold _ -> "EventHold"
539− EventDyn _ -> "EventDyn"
540− EventHoldIdentity _ -> "EventHoldIdentity"
541− EventDynIdentity _ -> "EventDynIdentity"
543−type EventSubscription a = (Maybe (SubscriberListTicket a), EventSubscribed a)
545−data EventSubscribed a
546− = EventSubscribedRoot {-# NOUNPACK #-} (RootSubscribed a)
547− | EventSubscribedNever
548− | forall b. EventSubscribedPush !(PushSubscribed b a)
549− | forall k. (GCompare k, a ~ DMap k Identity) => EventSubscribedMerge !(MergeSubscribed k)
550− | forall k. GCompare k => EventSubscribedFan !(k a) !(FanSubscribed k)
551− | EventSubscribedSwitch !(SwitchSubscribed a)
552− | EventSubscribedCoincidence !(CoincidenceSubscribed a)
554−unsubscribe :: EventSubscription a -> IO ()
555−unsubscribe (msln, _) = forM_ msln $ \sln -> WeakBag.remove sln
557−-- These function are constructor functions that are marked NOINLINE so they are
558−-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
559−-- so any weak references that are attached to the constructors will have their
560−-- finalizer run. Using the opaque constructor, does not see the
561−-- constructor application, so it behaves like an IORef and cannot be fused away.
563−-- The result is also evaluated to WHNF, since forcing a thunk invalidates
564−-- the weak pointer to it in some cases.
566−--TODO: I think all of these noinlines are now unnecessary
567−{-# NOINLINE newSubscriberPush #-}
568−newSubscriberPush :: (a -> ComputeM (Maybe b)) -> PushSubscribed a b -> IO (Subscriber a)
569−newSubscriberPush compute subd = return $! SubscriberPush compute subd
572− "newSubscriberHold/Identity" forall h. newSubscriberHold h = newSubscriberHoldIdentity h
574−{-# NOINLINE newSubscriberHold #-}
575−newSubscriberHold :: R.Patch p => Hold p a -> IO (Subscriber (p a))
576−newSubscriberHold h = return $! SubscriberHold h
578−{-# NOINLINE newSubscriberHoldIdentity #-}
579−newSubscriberHoldIdentity :: Hold Identity a -> IO (Subscriber (Identity a))
580−newSubscriberHoldIdentity h = return $! SubscriberHoldIdentity h
582−{-# NOINLINE newSubscriberMerge #-}
1187+{-# NOINLINE newInvalidatorPull #-}
583−newSubscriberMerge :: GCompare k => k a -> MergeSubscribed k -> IO (Subscriber a)
1188+newInvalidatorPull :: Pull x a -> IO (Invalidator x)
584−newSubscriberMerge k subd = return $! SubscriberMerge k subd
1189+newInvalidatorPull p = return $! InvalidatorPull p
586−{-# NOINLINE newSubscriberMergeChange #-}
1191+instance HasSpiderTimeline x => Filterable (Event x) where
587−newSubscriberMergeChange :: GCompare k => MergeSubscribed k -> IO (Subscriber (R.PatchDMap (DMap k Event)))
1192+ mapMaybe f = push $ return . f
588−newSubscriberMergeChange subd = return $! SubscriberMergeChange subd
590−{-# NOINLINE newSubscriberFan #-}
1194+instance HasSpiderTimeline x => Align (Event x) where
591−newSubscriberFan :: GCompare k => FanSubscribed k -> IO (Subscriber (DMap k Identity))
1195+ nil = eventNever
592−newSubscriberFan subd = return $! SubscriberFan subd
1196+#if MIN_VERSION_these(0, 8, 0)
1197+instance HasSpiderTimeline x => Semialign (Event x) where
1199+ align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
1200+ DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
594−{-# NOINLINE newSubscriberSwitch #-}
1202+#ifdef MIN_VERSION_semialign
595−newSubscriberSwitch :: SwitchSubscribed a -> IO (Subscriber a)
1203+#if MIN_VERSION_semialign(1,1,0)
596−newSubscriberSwitch subd = return $! SubscriberSwitch subd
1204+instance HasSpiderTimeline x => Zip (Event x) where
1206+ zip x y = mapMaybe justThese $ align x y
598−{-# NOINLINE newSubscriberCoincidenceOuter #-}
1209+data DynType x p = UnsafeDyn !(BehaviorM x (PatchTarget p), Event x p)
599−newSubscriberCoincidenceOuter :: CoincidenceSubscribed b -> IO (Subscriber (Event b))
1210+ | BuildDyn !(EventM x (PatchTarget p), Event x p)
600−newSubscriberCoincidenceOuter subd = return $! SubscriberCoincidenceOuter subd
1211+ | HoldDyn !(Hold x p)
602−{-# NOINLINE newSubscriberCoincidenceInner #-}
1213+newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
603−newSubscriberCoincidenceInner :: CoincidenceSubscribed a -> IO (Subscriber a)
604−newSubscriberCoincidenceInner subd = return $! SubscriberCoincidenceInner subd
606−{-# NOINLINE newInvalidatorSwitch #-}
1215+newMapDyn :: HasSpiderTimeline x => (a -> b) -> DynamicS x (Identity a) -> DynamicS x (Identity b)
607−newInvalidatorSwitch :: SwitchSubscribed a -> IO Invalidator
608−newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
610−{-# NOINLINE newInvalidatorPull #-}
611−newInvalidatorPull :: Pull a -> IO Invalidator
612−newInvalidatorPull p = return $! InvalidatorPull p
615− = DynamicHold !(Hold p a)
616− | p ~ Identity => DynamicHoldIdentity !(Hold Identity a)
618− | DynamicDyn !(Dyn p a)
619− | p ~ Identity => DynamicDynIdentity !(Dyn Identity a)
621−{-# INLINE current #-}
622−current :: R.Patch p => Dynamic p a -> Behavior a
624− DynamicHold h -> BehaviorHold h
625− DynamicHoldIdentity h -> BehaviorHoldIdentity h
626− DynamicConst a -> BehaviorConst a
627− DynamicDyn d -> BehaviorDyn d
628− DynamicDynIdentity d -> BehaviorDynIdentity d
630−--TODO: If you only need updated, not current, can we avoid actually constructing the Hold?
631−{-# INLINE updated #-}
632−updated :: R.Patch p => Dynamic p a -> Event (p a)
634− DynamicHold h -> EventHold h
635− DynamicHoldIdentity h -> EventHoldIdentity h
636− DynamicConst _ -> EventNever
637− DynamicDyn d -> EventDyn d
638− DynamicDynIdentity d -> EventDynIdentity d
640−newMapDyn :: (a -> b) -> Dynamic Identity a -> Dynamic Identity b
641−newMapDyn f d = DynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ current d) (fmap (Identity . f . runIdentity) $ updated d)
1216+newMapDyn f d = dynamicDynIdentity $ unsafeBuildDynamic (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
643−instance Functor (Dynamic Identity) where
644− fmap f d = newMapDyn f d
646−instance Applicative (Dynamic Identity) where
648− (<*>) = zipDynWith ($)
652−instance R.FunctorMaybe Event where
653− fmapMaybe f = push $ return . f
655−instance Align Event where
657− align ea eb = R.fmapMaybe R.dmapToThese $ merge $ DynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
659--TODO: Avoid the duplication between this and R.zipDynWith
1218--TODO: Avoid the duplication between this and R.zipDynWith
660−zipDynWith :: (a -> b -> c) -> Dynamic Identity a -> Dynamic Identity b -> Dynamic Identity c
1219+zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> DynamicS x (Identity a) -> DynamicS x (Identity b) -> DynamicS x (Identity c)
661zipDynWith f da db =
1220zipDynWith f da db =
662− let eab = align (updated da) (updated db)
1221+ let eab = align (dynamicUpdated da) (dynamicUpdated db)
663 ec = flip push eab $ \o -> do
1222 ec = flip push eab $ \o -> do
664 (a, b) <- case o of
1223 (a, b) <- case o of
665 This (Identity a) -> do
1224 This (Identity a) -> do
666− b <- readBehaviorUntracked $ current db
1225+ b <- readBehaviorUntracked $ dynamicCurrent db
667 return (a, b)
1226 return (a, b)
668 That (Identity b) -> do
1227 That (Identity b) -> do
669− a <- readBehaviorUntracked $ current da
1228+ a <- readBehaviorUntracked $ dynamicCurrent da
670 return (a, b)
1229 return (a, b)
671 These (Identity a) (Identity b) -> return (a, b)
1230 These (Identity a) (Identity b) -> return (a, b)
672 return $ Just $ Identity $ f a b
1231 return $ Just $ Identity $ f a b
673− in DynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (current da) <*> readBehaviorUntracked (current db)) ec
1232+ in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
675−instance Monad (Dynamic Identity) where
1234+buildDynamic :: (Defer (SomeDynInit x) m, Patch p) => EventM x (PatchTarget p) -> Event x p -> m (Dyn x p)
676− {-# INLINE return #-}
1235+buildDynamic readV0 v' = do
677− return = pure
1236+ result <- liftIO $ newIORef $ BuildDyn (readV0, v')
678− {-# INLINE (>>=) #-}
1237+ let !d = Dyn result
679− x >>= f = DynamicDynIdentity $ newJoinDyn $ newMapDyn f x --TODO: (>>), fail
1238+ defer $ SomeDynInit d
680− {-# INLINE (>>) #-}
1239+ return d
683− fail _ = error "Dynamic does not support 'fail'"
685−newtype Dyn p a = Dyn { unDyn :: IORef (Either (BehaviorM a, Event (p a)) (Hold p a)) }
687−unsafeDyn :: BehaviorM a -> Event (p a) -> Dyn p a
688−unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
689− where x = (readV0, v')
691−newJoinDyn :: Dynamic Identity (Dynamic Identity a) -> Dyn Identity a
1241+unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
692−newJoinDyn d =
1242+unsafeBuildDynamic readV0 v' =
693− let readV0 = readBehaviorTracked . current =<< readBehaviorTracked (current d)
1243+ Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
694− eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . current . runIdentity) $ updated d
695− eInner = switch $ fmap updated $ current d
696− eBoth = coincidence $ fmap (updated . runIdentity) $ updated d
697− v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
698− in unsafeDyn readV0 v'
700−--type role Behavior representational
702− = forall p. BehaviorHold !(Hold p a)
703− | BehaviorHoldIdentity !(Hold Identity a)
705− | BehaviorPull !(Pull a)
706− | BehaviorDynIdentity !(Dyn Identity a)
707− | forall p. R.Patch p => BehaviorDyn !(Dyn p a)
709-- ResultM can read behaviors and events
1245-- ResultM can read behaviors and events
710type ResultM = EventM
1246type ResultM = EventM
712−{-# NOINLINE unsafeNewIORef #-}
713−unsafeNewIORef :: a -> b -> IORef b
714−unsafeNewIORef _ b = unsafePerformIO $ newIORef b
716−instance Functor Event where
1248+instance HasSpiderTimeline x => Functor (Event x) where
717 fmap f = push $ return . Just . f
1249 fmap f = push $ return . Just . f
719−instance Functor Behavior where
1251+instance Functor (Behavior x) where
720− fmap f = pull . liftM f . readBehaviorTracked
1252+ fmap f = pull . fmap f . readBehaviorTracked
722−{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
1254+{-# INLINE push #-}
723−push :: forall a b. (a -> ComputeM (Maybe b)) -> Event a -> Event b
1255+push :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
724−push f e = EventPush $ Push
1256+push f e = cacheEvent (pushCheap f e)
727− , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
729−-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
731−{-# NOINLINE pull #-}
1258+{-# INLINABLE pull #-}
732−pull :: BehaviorM a -> Behavior a
1259+pull :: BehaviorM x a -> Behavior x a
733−pull a = BehaviorPull $ Pull
1260+pull a = unsafePerformIO $ do
734− { pullCompute = a
1261+ ref <- newIORef Nothing
735− , pullValue = unsafeNewIORef a Nothing
736#ifdef DEBUG_NODEIDS
1262#ifdef DEBUG_NODEIDS
737− , pullNodeId = unsafeNodeId a
1263+ nid <- newNodeId
739− }
1265+ pure $ behaviorPull $ Pull
740−
1266+ { pullCompute = a
741−{-# NOINLINE switch #-}
1267+ , pullValue = ref
742−switch :: Behavior (Event a) -> Event a
1268+#ifdef DEBUG_NODEIDS
743−switch a = EventSwitch $ Switch
1269+ , pullNodeId = nid
744− { switchParent = a
1270+#endif
745− , switchSubscribed = unsafeNewIORef a Nothing
748−coincidence :: Event (Event a) -> Event a
1273+{-# INLINABLE switch #-}
749−coincidence a = EventCoincidence $ Coincidence
1274+switch :: HasSpiderTimeline x => Behavior x (Event x a) -> Event x a
750− { coincidenceParent = a
1275+switch a = unsafePerformIO $ do
751− , coincidenceSubscribed = unsafeNewIORef a Nothing
1276+ ref <- newIORef Nothing
1277+ pure $ eventSwitch $ Switch
1279+ , switchSubscribed = ref
754−propagateAndUpdateSubscribersRef :: SubscriberList a -> a -> EventM x ()
1282+coincidence :: HasSpiderTimeline x => Event x (Event x a) -> Event x a
755−propagateAndUpdateSubscribersRef subscribersRef a = do
1283+coincidence a = unsafePerformIO $ do
756− propagate a subscribersRef
1284+ ref <- newIORef Nothing
1285+ pure $ eventCoincidence $ Coincidence
1286+ { coincidenceParent = a
1287+ , coincidenceSubscribed = ref
758-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
1290-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
759−run :: [DSum RootTrigger Identity] -> ResultM x b -> SpiderHost x b
1291+run :: forall x b. HasSpiderTimeline x => [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
760run roots after = do
1292run roots after = do
761− tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
1293+ tracePropagate (Proxy :: Proxy x) $ "Running an event frame with " <> show (length roots) <> " events"
762− spiderEnv <- SpiderHost ask
1294+ let t = spiderTimeline :: SpiderTimelineEnv x
763− result <- SpiderHost $ lift $ withMVar (_spiderEnv_lock spiderEnv) $ \_ -> flip runReaderT spiderEnv $ unSpiderHost $ runFrame $ do
1295+ result <- SpiderHost $ withMVar (_spiderTimeline_lock (unSTE t)) $ \_ -> unSpiderHost $ runFrame $ do
764 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
1296 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
765 occBefore <- liftIO $ do
1297 occBefore <- liftIO $ do
766 occBefore <- readIORef occRef
1298 occBefore <- readIORef occRef
@@ -771,43 +1303,40 @@ run roots after = do
771 return $ Just r
1303 return $ Just r
772 else return Nothing
1304 else return Nothing
773 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
1305 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
774− propagateAndUpdateSubscribersRef subscribersRef a
1306+ propagate a subscribersRef
775− delayedRef <- EventM $ asks eventEnvDelayedMerges
1307+ delayedRef <- asksEventEnv eventEnvDelayedMerges
776 let go = do
1308 let go = do
777 delayed <- liftIO $ readIORef delayedRef
1309 delayed <- liftIO $ readIORef delayedRef
778 case IntMap.minViewWithKey delayed of
1310 case IntMap.minViewWithKey delayed of
779 Nothing -> return ()
1311 Nothing -> return ()
780 Just ((currentHeight, cur), future) -> do
1312 Just ((currentHeight, cur), future) -> do
781− tracePropagate $ "Running height " ++ show currentHeight
1313+ tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
782 putCurrentHeight $ Height currentHeight
1314 putCurrentHeight $ Height currentHeight
783− liftIO $ writeIORef delayedRef future
1315+ liftIO $ writeIORef delayedRef $! future
784− forM_ cur $ \d -> case d of
1316+ sequence_ cur
785− DelayedMerge subscribed -> do
786− height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
787− case height `compare` Height currentHeight of
788− LT -> error "Somehow a merge's height has been decreased after it was scheduled"
789− GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
791− m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
792− liftIO $ writeIORef (mergeSubscribedAccum subscribed) DMap.empty
793− --TODO: Assert that m is not empty
794− liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $ Just m
795− scheduleClear $ mergeSubscribedOccurrence subscribed
796− propagateAndUpdateSubscribersRef (mergeSubscribedSubscribers subscribed) m
799 putCurrentHeight maxBound
1319 putCurrentHeight maxBound
801− tracePropagate "Done running an event frame"
1321+ tracePropagate (Proxy :: Proxy x) "Done running an event frame"
802 return result
1322 return result
804−data SomeClear = forall a. SomeClear (IORef (Maybe a))
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?)
806−data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1333+newtype Clear a = Clear (IORef (Maybe a))
808−data SomeAssignment = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak Invalidator]) a
1335+newtype IntClear a = IntClear (IORef (IntMap a))
810−data DelayedMerge = forall k. DelayedMerge (MergeSubscribed k)
1337+newtype RootClear k = RootClear (IORef (DMap k Identity))
1339+data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
812debugFinalize :: Bool
1341debugFinalize :: Bool
813debugFinalize = False
1342debugFinalize = False
@@ -817,79 +1346,110 @@ mkWeakPtrWithDebug x debugNote = do
817 x' <- evaluate x
1346 x' <- evaluate x
818 mkWeakPtr x' $
1347 mkWeakPtr x' $
819 if debugFinalize
1348 if debugFinalize
820− then Just $ putStrLn $ "finalizing: " ++ debugNote
1349+ then Just $ debugStrLn $ "finalizing: " ++ debugNote
821 else Nothing
1350 else Nothing
823type WeakList a = [Weak a]
1352type WeakList a = [Weak a]
825−{-# INLINE withIncreasedDepth #-}
1354+type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
826#ifdef DEBUG
1359#ifdef DEBUG
1361+debugSubscriber :: forall x a. HasSpiderTimeline x => String -> Subscriber x a -> IO (Subscriber x a)
1362+debugSubscriber description = return . debugSubscriber' description
1364+debugSubscriber' :: forall x a. HasSpiderTimeline x => String -> Subscriber x a -> Subscriber x a
1365+debugSubscriber' description subscribed = Subscriber
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"
827−withIncreasedDepth :: CanTrace x m => m a -> m a
1381+{-# INLINE withIncreasedDepth #-}
1382+withIncreasedDepth :: forall proxy x m a. CanTrace x m => proxy x -> m a -> m a
828−withIncreasedDepth a = do
1383+withIncreasedDepth _ a = do
829− spiderEnv <- askSpiderEnv
1384+ liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) succ
830− liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) succ
831 result <- a
1385 result <- a
832− liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) pred
1386+ liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
833 return result
1387 return result
835−withIncreasedDepth :: m a -> m a
836−withIncreasedDepth = id
839−type CanTrace x m = (HasSpiderEnv x m, MonadIO m)
841{-# INLINE tracePropagate #-}
1389{-# INLINE tracePropagate #-}
842−tracePropagate :: (CanTrace x m) => String -> m ()
1390+tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
843−tracePropagate = traceWhen debugPropagate
1391+tracePropagate p = when debugPropagate . trace p
845−{-# INLINE traceSubscribe #-}
846−traceSubscribe :: String -> IO ()
847−traceSubscribe = when debugSubscribe . liftIO . putStrLn
849{-# INLINE traceInvalidate #-}
1393{-# INLINE traceInvalidate #-}
850traceInvalidate :: String -> IO ()
1394traceInvalidate :: String -> IO ()
851−traceInvalidate = when debugInvalidate . liftIO . putStrLn
1395+traceInvalidate = when debugInvalidate . liftIO . debugStrLn
853−{-# INLINE traceWhen #-}
1397+{-# INLINE traceInvalidateHeight #-}
854−traceWhen :: (CanTrace x m) => Bool -> String -> m ()
1398+traceInvalidateHeight :: String -> IO ()
855−traceWhen b message = traceMWhen b $ return message
1399+traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
857−{-# INLINE traceMWhen #-}
1401+{-# INLINE trace #-}
858−traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
1402+trace :: (CanTrace x m) => proxy x -> String -> m ()
1403+trace p message = traceM p $ return message
1405+{-# INLINE traceM #-}
1406+traceM :: forall x proxy m. (CanTrace x m) => proxy x -> m String -> m ()
859−traceMWhen b getMessage = when b $ do
1407+traceM _ getMessage = do
860 message <- getMessage
1408 message <- getMessage
861−#ifdef DEBUG
1409+ d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
862− spiderEnv <- askSpiderEnv
1410+ liftIO $ debugStrLn $ replicate d ' ' <> message
863− d <- liftIO $ readIORef $ _spiderEnv_depth spiderEnv
1411+
1414+{-# INLINE withIncreasedDepth #-}
1415+withIncreasedDepth :: proxy x -> m a -> m a
1416+withIncreasedDepth _ = id
1418+{-# INLINE tracePropagate #-}
1419+tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420+tracePropagate _ _ = return ()
1422+{-# INLINE traceInvalidate #-}
1423+traceInvalidate :: String -> IO ()
1424+traceInvalidate _ = return ()
1426+{-# INLINE traceInvalidateHeight #-}
1427+traceInvalidateHeight :: String -> IO ()
1428+traceInvalidateHeight _ = return ()
1430+{-# INLINE debugSubscriber #-}
1431+debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
1432+debugSubscriber _ = return
1434+{-# INLINE debugSubscriber' #-}
1435+debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436+debugSubscriber' _ = id
1440+{-# INLINE trace #-}
1441+trace :: (CanTrace x m) => proxy x -> String -> m ()
1442+trace _ _ = return ()
1444+{-# INLINE traceM #-}
1445+traceM :: (CanTrace x m) => proxy x -> m String -> m ()
1446+traceM _ _ = return ()
867− liftIO $ putStrLn $ replicate d ' ' <> message
869whoCreatedIORef :: IORef a -> IO [String]
1450whoCreatedIORef :: IORef a -> IO [String]
870whoCreatedIORef (IORef a) = whoCreated $! a
1451whoCreatedIORef (IORef a) = whoCreated $! a
872−whoCreatedEventSubscribed :: EventSubscribed a -> IO [String]
873−whoCreatedEventSubscribed = \case
874− EventSubscribedRoot _ -> return ["root"]
875− EventSubscribedNever -> return ["never"]
876− EventSubscribedPush subscribed -> whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
877− EventSubscribedFan _ subscribed -> whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
878− EventSubscribedMerge subscribed -> whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
879− EventSubscribedSwitch subscribed -> whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
880− EventSubscribedCoincidence subscribed -> whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
882−walkInvalidHeightParents :: EventSubscribed a -> IO [Some EventSubscribed]
883−walkInvalidHeightParents s0 = do
884− subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
885− h <- liftIO $ readIORef $ eventSubscribedHeightRef s
886− when (h == invalidHeight) $ do
887− when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) invalidHeightBeingTraversed
888− modify (Some.This s :)
889− mapM_ loop =<< liftIO (eventSubscribedGetParents s)
890− forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) invalidHeight
893groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
1453groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
894groupByHead = \case
1454groupByHead = \case
895 [] -> []
1455 [] -> []
@@ -900,559 +1460,288 @@ groupByHead = \case
900 | otherwise -> (x, xs :| []) : l
1460 | otherwise -> (x, xs :| []) : l
902listsToForest :: Eq a => [[a]] -> Forest a
1462listsToForest :: Eq a => [[a]] -> Forest a
903−listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1463+listsToForest lists = buildForest <$> groupByHead (mapMaybe nonEmpty lists)
1464+ where buildForest (a, lists') = Node a $ listsToForest $ toList lists'
905−-- | Propagate everything at the current height
1466+showStacks :: [[String]] -> String
906−propagate :: a -> SubscriberList a -> EventM x ()
1467+showStacks = drawForest . listsToForest . fmap (filterStack "Reflex.Spider.Internal")
907−propagate a subscribers = withIncreasedDepth $ do
908− -- 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
909− --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
910− WeakBag.traverse subscribers $ \s -> case s of
911− SubscriberPush compute subscribed -> {-# SCC "traversePush" #-} do
912− tracePropagate $ "SubscriberPush" <> showNodeId subscribed
913− occ <- runComputeM $ compute a
915− Nothing -> return () -- No need to write a Nothing back into the Ref
917− liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
918− scheduleClear $ pushSubscribedOccurrence subscribed
919− propagate o $ pushSubscribedSubscribers subscribed
920− SubscriberMerge k subscribed -> {-# SCC "traverseMerge" #-} do
921− tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
922− oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
923− let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
924− tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
925− liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
926− when (DMap.null oldM) $ do -- Only schedule the firing once
927− height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
928− --TODO: assertions about height
929− currentHeight <- getCurrentHeight
930− when (height <= currentHeight) $ do
931− myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
932− if height /= invalidHeight
933− then error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
935− nodesInvolvedInCycle <- walkInvalidHeightParents $ EventSubscribedMerge subscribed
936− stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
937− error $ "Causality loop found:\n" <> drawForest (listsToForest stacks)
938− scheduleMerge height subscribed
939− SubscriberMergeChange subscribed -> {-# SCC "traverseMergeChange" #-} do
940− tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
941− defer $ SomeMergeUpdate a subscribed
942− SubscriberFan subscribed -> {-# SCC "traverseFan" #-} do
943− subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
944− tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
945− --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
946− forM_ (DMap.toList a) $ \(k :=> Identity v) -> {-# SCC "SubscriberFan" #-} case DMap.lookup k subs of
948− tracePropagate "No subscriber for key"
951− propagate v $ _fanSubscribedChildren_list subsubs
953− SubscriberHold h -> {-# SCC "traverseHold" #-} propagateSubscriberHold h a
954− SubscriberHoldIdentity h -> {-# SCC "traverseHoldIdentity" #-} propagateSubscriberHold h a
955− SubscriberSwitch subscribed -> {-# SCC "traverseSwitch" #-} do
956− tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
957− liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
958− scheduleClear $ switchSubscribedOccurrence subscribed
959− propagate a $ switchSubscribedSubscribers subscribed
960− SubscriberCoincidenceOuter subscribed -> {-# SCC "traverseCoincidenceOuter" #-} do
961− tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
962− outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
963− tracePropagate $ " outerHeight = " <> show outerHeight
964− (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
965− tracePropagate $ " isJust occ = " <> show (isJust occ)
966− tracePropagate $ " innerHeight = " <> show innerHeight
967− liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
968− scheduleClear $ coincidenceSubscribedInnerParent subscribed
971− when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
972− writeIORef (coincidenceSubscribedHeight subscribed) innerHeight
973− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) invalidateSubscriberHeight
974− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) recalculateSubscriberHeight
975− Just o -> do -- Since it's already firing, no need to adjust height
976− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
977− scheduleClear $ coincidenceSubscribedOccurrence subscribed
978− propagate o $ coincidenceSubscribedSubscribers subscribed
979− SubscriberCoincidenceInner subscribed -> {-# SCC "traverseCoincidenceInner" #-} do
980− tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
981− occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
983− Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
985− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
986− scheduleClear $ coincidenceSubscribedOccurrence subscribed
987− propagate a $ coincidenceSubscribedSubscribers subscribed
988− SubscriberHandle -> {-# SCC "traverseHandle" #-} tracePropagate "SubscriberHandle"
990−{-# INLINE propagateSubscriberHold #-}
1469+filterStack :: String -> [String] -> [String]
991−propagateSubscriberHold :: R.Patch p => Hold p a -> p a -> EventM x ()
1470+#ifdef DEBUG_HIDE_INTERNALS
992−propagateSubscriberHold h a = do
1471+filterStack prefix = filter (not . (prefix `isPrefixOf`))
993− {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
1472+#else
994− invalidators <- liftIO $ readIORef $ holdInvalidators h
1473+filterStack prefix = id
995− return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1474+#endif
996− v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
997− case {-# SCC "apply" #-} R.apply a v of
998− Nothing -> return ()
1000− {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
1001− vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
1002− iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
1003− defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
1005−data SomeResetCoincidence = forall a. SomeResetCoincidence !(EventSubscription a) !(Maybe (CoincidenceSubscribed a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1476+#ifdef DEBUG_CYCLES
1007−{-# INLINE subscribeCoincidenceInner #-}
1478+data EventLoopException = EventLoopException [[String]]
1008−subscribeCoincidenceInner :: CanSubscribe x m => Event a -> Height -> CoincidenceSubscribed a -> m (Maybe a, Height, EventSubscribed a)
1479+instance Exception EventLoopException
1009−subscribeCoincidenceInner o outerHeight subscribedUnsafe = do
1010− subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
1011− subscription@(_, innerSubd) <- subscribe o subInner
1012− innerOcc <- liftIO $ readEventSubscribed innerSubd
1013− innerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef innerSubd
1014− let height = max innerHeight outerHeight
1015− defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
1016− return (innerOcc, height, innerSubd)
1018−{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> BehaviorM a #-}
1481+instance Show EventLoopException where
1019−{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> EventM x a #-}
1482+ show (EventLoopException stacks) = "causality loop detected:\n" <> if null stacks
1020−readBehaviorUntracked :: Defer SomeHoldInit m => Behavior a -> m a
1483+ then "no location information, compile with profiling enabled for stack tree"
1021−readBehaviorUntracked b = do
1484+ else showStacks stacks
1022− holdInits <- getDeferralQueue
1485+
1023− liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
1486+#else
1488+data EventLoopException = EventLoopException
1489+instance Exception EventLoopException
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"
1498+{-# INLINE propagateSubscriberHold #-}
1499+propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
1500+propagateSubscriberHold h a = do
1501+ {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1502+ invalidators <- liftIO $ readIORef $ holdInvalidators h
1503+ return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1025−runBehaviorM :: BehaviorM a -> Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]) -> IORef [SomeHoldInit] -> IO a
1505+ v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1026−runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
1506+ case {-# SCC "apply" #-} apply a v of
1507+ Nothing -> return ()
1509+ {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510+ tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1511+ vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
1512+ iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
1513+ defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
1028−askInvalidator :: BehaviorM (Maybe (Weak Invalidator))
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
1029−askInvalidator = liftM (fmap fst . fst) $ BehaviorM ask
1031−askParentsRef :: BehaviorM (Maybe (IORef [SomeBehaviorSubscribed]))
1517+runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1032−askParentsRef = liftM (fmap snd . fst) $ BehaviorM ask
1518+runBehaviorM a mwi holdInits = runReaderIO (unBehaviorM a) (mwi, holdInits)
1034−askBehaviorHoldInits :: BehaviorM (IORef [SomeHoldInit])
1520+askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
1035−askBehaviorHoldInits = liftM snd $ BehaviorM ask
1521+askInvalidator = do
1524+ Nothing -> return Nothing
1525+ Just (!wi, _) -> return $ Just wi
1037−readBehaviorTracked :: Behavior a -> BehaviorM a
1527+askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
1038−readBehaviorTracked b = case b of
1528+askParentsRef = do
1039− BehaviorHold h -> readHoldTracked h
1529+ (!m, _) <- ask
1040− BehaviorHoldIdentity h -> readHoldTracked h
1530+ case m of
1041− BehaviorConst a -> return a
1531+ Nothing -> return Nothing
1042− BehaviorPull p -> do
1043− val <- liftIO $ readIORef $ pullValue p
1045− Just subscribed -> do
1046− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1047− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
1048− liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
1049− return $ pullSubscribedValue subscribed
1051− i <- liftIO $ newInvalidatorPull p
1052− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
1053− parentsRef <- liftIO $ newIORef []
1054− holdInits <- askBehaviorHoldInits
1055− a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
1056− invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
1057− parents <- liftIO $ readIORef parentsRef
1058− let subscribed = PullSubscribed
1059− { pullSubscribedValue = a
1060− , pullSubscribedInvalidators = invsRef
1061− , pullSubscribedOwnInvalidator = i
1062− , pullSubscribedParents = parents
1064− liftIO $ writeIORef (pullValue p) $ Just subscribed
1065− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1066− return a
1532+ Just (_, !p) -> return $ Just p
1067− BehaviorDyn d -> readHoldTracked =<< getDynHold d
1068− BehaviorDynIdentity d -> readHoldTracked =<< getDynHold d
1070−{-# INLINE readHoldTracked #-}
1534+askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1071−readHoldTracked :: Hold p a -> BehaviorM a
1535+askBehaviorHoldInits = do
1072−readHoldTracked h = do
1536+ (_, !his) <- ask
1073− result <- liftIO $ readIORef $ holdValue h
1074− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
1075− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
1076− return result
1537+ return his
1078{-# INLINE getDynHold #-}
1539{-# INLINE getDynHold #-}
1079−getDynHold :: (Defer SomeHoldInit m, R.Patch p) => Dyn p a -> m (Hold p a)
1540+getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
1080getDynHold d = do
1541getDynHold d = do
1081 mh <- liftIO $ readIORef $ unDyn d
1542 mh <- liftIO $ readIORef $ unDyn d
1082 case mh of
1543 case mh of
1083− Right h -> return h
1544+ HoldDyn h -> return h
1084− Left (readV0, v') -> do
1545+ UnsafeDyn (readV0, v') -> do
1085 holdInits <- getDeferralQueue
1546 holdInits <- getDeferralQueue
1086 v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1547 v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1549+ BuildDyn (readV0, v') -> do
1550+ v0 <- liftIO $ runEventM readV0
1087 h <- hold v0 v'
1554 h <- hold v0 v'
1088− liftIO $ writeIORef (unDyn d) $ Right h
1555+ liftIO $ writeIORef (unDyn d) $ HoldDyn h
1089 return h
1556 return h
1092−readEvent :: Event a -> ResultM (Maybe a)
1093−readEvent e = case e of
1094− EventRoot k r -> liftIO . liftM (coerce . DMap.lookup k) . readIORef $ rootOccurrence r
1095− EventNever -> return Nothing
1097− subscribed <- getPushSubscribed p
1098− liftIO $ readPushSubscribed subscribed
1100− subscribed <- getMergeSubscribed m
1101− liftIO $ readMergeSubscribed subscribed
1103− subscribed <- getFanSubscribed f
1104− liftIO $ readFanSubscribed k subscribed
1105− EventSwitch s -> do
1106− subscribed <- getSwitchSubscribed s
1107− liftIO $ readSwitchSubscribed subscribed
1108− EventCoincidence c -> do
1109− subscribed <- getCoincidenceSubscribed c
1110− liftIO $ readCoincidenceSubscribed subscribed
1111− EventHold h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1112− EventDyn d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1113− EventHoldIdentity h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1114− EventDynIdentity d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1117−readEventSubscribed :: EventSubscribed a -> IO (Maybe a)
1118−readEventSubscribed = \case
1119− EventSubscribedRoot rs -> readRootSubscribed rs
1120− EventSubscribedNever -> return Nothing
1121− EventSubscribedPush ps -> readPushSubscribed ps
1122− EventSubscribedMerge ms -> readMergeSubscribed ms
1123− EventSubscribedFan k fs -> readFanSubscribed k fs
1124− EventSubscribedSwitch ss -> readSwitchSubscribed ss
1125− EventSubscribedCoincidence cs -> readCoincidenceSubscribed cs
1127−readRootSubscribed :: RootSubscribed a -> IO (Maybe a)
1128−readRootSubscribed = rootSubscribedOccurrence
1130−readPushSubscribed :: PushSubscribed b a -> IO (Maybe a)
1131−readPushSubscribed subscribed = do
1132− result <- readIORef $ pushSubscribedOccurrence subscribed -- Since ResultM is always called after the final height is reached, this will always be valid
1133− touch $ pushSubscribedSelf subscribed
1136−readMergeSubscribed :: MergeSubscribed k -> IO (Maybe (DMap k Identity))
1137−readMergeSubscribed subscribed = do
1138− result <- readIORef $ mergeSubscribedOccurrence subscribed
1139− touch $ mergeSubscribedParents subscribed
1142−readFanSubscribed :: GCompare k => k a -> FanSubscribed k -> IO (Maybe a)
1143−readFanSubscribed k fs = do
1144− parentOcc <- readEventSubscribed $ snd $ fanSubscribedParent fs
1145− return $ coerce $ DMap.lookup k =<< parentOcc
1147−readSwitchSubscribed :: SwitchSubscribed a -> IO (Maybe a)
1148−readSwitchSubscribed subscribed = do
1149− result <- readIORef $ switchSubscribedOccurrence subscribed
1150− touch $ switchSubscribedOwnInvalidator subscribed
1153−readCoincidenceSubscribed :: CoincidenceSubscribed a -> IO (Maybe a)
1154−readCoincidenceSubscribed subscribed = do
1155− result <- readIORef $ coincidenceSubscribedOccurrence subscribed
1156− touch $ coincidenceSubscribedOuter subscribed
1157− --TODO: do we need to touch the inner subscriber?
1160-- Always refers to 0
1559-- Always refers to 0
1161{-# NOINLINE zeroRef #-}
1560{-# NOINLINE zeroRef #-}
1162zeroRef :: IORef Height
1561zeroRef :: IORef Height
1163zeroRef = unsafePerformIO $ newIORef zeroHeight
1562zeroRef = unsafePerformIO $ newIORef zeroHeight
1165−{-# SPECIALIZE getEventSubscribed :: Event a -> Subscriber a -> EventM x (EventSubscription a) #-}
1166−getEventSubscribed :: forall x m a. CanSubscribe x m => Event a -> Subscriber a -> m (EventSubscription a)
1167−getEventSubscribed e sub = case e of
1168− EventRoot k r -> wrap EventSubscribedRoot $ liftIO . getRootSubscribed k r
1169− EventNever -> return (Nothing, EventSubscribedNever)
1170− EventPush p -> wrap EventSubscribedPush $ getPushSubscribed p
1171− EventFan k f -> wrap (EventSubscribedFan k) $ getFanSubscribed k f
1172− EventMerge m -> wrap EventSubscribedMerge $ getMergeSubscribed m
1173− EventSwitch s -> wrap EventSubscribedSwitch $ getSwitchSubscribed s
1174− EventCoincidence c -> wrap EventSubscribedCoincidence $ getCoincidenceSubscribed c
1175− EventHold h -> subscribeHoldEvent h sub
1176− EventDyn j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1177− EventHoldIdentity h -> subscribeHoldEvent h sub
1178− EventDynIdentity j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1180− wrap :: (t -> EventSubscribed a) -> (Subscriber a -> m (SubscriberListTicket a, t)) -> m (EventSubscription a)
1181− wrap tag getSpecificSubscribed = do
1182− (sln, subd) <- getSpecificSubscribed sub
1183− return (Just sln, tag subd)
1185−{-# INLINE subscribeHoldEvent #-}
1186−subscribeHoldEvent :: (CanSubscribe x m, R.Patch p) => Hold p a -> Subscriber (p a) -> m (EventSubscription (p a))
1187−subscribeHoldEvent h sub = do
1188− (_, subd) <- getHoldEventSubscription h
1189− sln <- liftIO $ subscribeEventSubscribed subd sub
1192−{-# INLINE debugSubscribe #-}
1193−debugSubscribe :: Bool
1194−debugSubscribe = False
1196−{-# INLINE subscribeEventSubscribed #-}
1197−subscribeEventSubscribed :: EventSubscribed a -> Subscriber a -> IO (Maybe (SubscriberListTicket a))
1198−subscribeEventSubscribed es sub = case es of
1199− EventSubscribedRoot r -> do
1200− traceSubscribe $ "subscribeEventSubscribed Root"
1201− fmap Just $ subscribeRootSubscribed r sub
1202− EventSubscribedNever -> do
1203− traceSubscribe $ "subscribeEventSubscribed Never"
1205− EventSubscribedPush subscribed -> do
1206− traceSubscribe $ "subscribeEventSubscribed Push"
1207− fmap Just $ subscribePushSubscribed subscribed sub
1208− EventSubscribedFan k subscribed -> do
1209− traceSubscribe $ "subscribeEventSubscribed Fan"
1210− fmap Just $ subscribeFanSubscribed k subscribed sub
1211− EventSubscribedMerge subscribed -> do
1212− traceSubscribe $ "subscribeEventSubscribed Merge"
1213− fmap Just $ subscribeMergeSubscribed subscribed sub
1214− EventSubscribedSwitch subscribed -> do
1215− traceSubscribe $ "subscribeEventSubscribed Switch"
1216− fmap Just $ subscribeSwitchSubscribed subscribed sub
1217− EventSubscribedCoincidence subscribed -> do
1218− traceSubscribe $ "subscribeEventSubscribed Coincidence"
1219− fmap Just $ subscribeCoincidenceSubscribed subscribed sub
1221−{-# INLINE eventSubscribedHeightRef #-}
1222−eventSubscribedHeightRef :: EventSubscribed a -> IORef Height
1223−eventSubscribedHeightRef = \case
1224− EventSubscribedRoot _ -> zeroRef
1225− EventSubscribedNever -> zeroRef
1226− EventSubscribedPush subscribed -> pushSubscribedHeight subscribed
1227− EventSubscribedFan _ subscribed -> eventSubscribedHeightRef $ snd $ fanSubscribedParent subscribed
1228− EventSubscribedMerge subscribed -> mergeSubscribedHeight subscribed
1229− EventSubscribedSwitch subscribed -> switchSubscribedHeight subscribed
1230− EventSubscribedCoincidence subscribed -> coincidenceSubscribedHeight subscribed
1232−{-# INLINE eventSubscribedHasOwnHeightRef #-}
1233−eventSubscribedHasOwnHeightRef :: EventSubscribed a -> Bool
1234−eventSubscribedHasOwnHeightRef = \case
1235− EventSubscribedRoot _ -> False
1236− EventSubscribedNever -> False
1237− EventSubscribedPush _ -> False
1238− EventSubscribedFan _ _ -> False
1239− EventSubscribedMerge _ -> True
1240− EventSubscribedSwitch _ -> True
1241− EventSubscribedCoincidence _ -> True
1243−{-# INLINE eventSubscribedGetParents #-}
1244−eventSubscribedGetParents :: EventSubscribed a -> IO [Some EventSubscribed]
1245−eventSubscribedGetParents = \case
1246− EventSubscribedRoot _ -> return []
1247− EventSubscribedNever -> return []
1248− EventSubscribedPush subscribed -> return [Some.This $ snd $ pushSubscribedParent subscribed]
1249− EventSubscribedFan _ subscribed -> return [Some.This $ snd $ fanSubscribedParent subscribed]
1250− EventSubscribedMerge subscribed -> do
1251− ps <- readIORef $ mergeSubscribedParents subscribed
1252− return $ fmap (\(_ :=> v) -> Some.This $ snd $ mergeSubscribedParentSubscription v) $ DMap.toList ps
1253− EventSubscribedSwitch subscribed -> do
1254− s <- readIORef $ switchSubscribedCurrentParent subscribed
1255− return [Some.This $ snd s]
1256− EventSubscribedCoincidence subscribed -> do
1257− innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
1258− let outerParent = Some.This $ snd $ coincidenceSubscribedOuterParent subscribed
1259− innerParents = maybeToList $ fmap Some.This innerSubscription
1260− return $ outerParent : innerParents
1262−type CanSubscribe x m =
1264− , HasCurrentHeight m
1265− , Defer SomeHoldInit m, Defer SomeMergeInit m -- The things we need to lazily initialize state
1266− , Defer SomeClear m -- Wiping out event firings
1267− , Defer SomeAssignment m -- Updating state
1268− , Defer SomeResetCoincidence m
1271−{-# INLINE subscribe #-}
1272−subscribe :: CanSubscribe x m => Event a -> Subscriber a -> m (EventSubscription a)
1273−subscribe = getEventSubscribed
1275−getRootSubscribed :: GCompare k => k a -> Root k -> Subscriber a -> IO (SubscriberListTicket a, RootSubscribed a)
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)
1276getRootSubscribed k r sub = do
1565getRootSubscribed k r sub = do
1277 mSubscribed <- readIORef $ rootSubscribed r
1566 mSubscribed <- readIORef $ rootSubscribed r
1567+ let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
1278 case DMap.lookup k mSubscribed of
1568 case DMap.lookup k mSubscribed of
1279 Just subscribed -> {-# SCC "hitRoot" #-} do
1569 Just subscribed -> {-# SCC "hitRoot" #-} do
1280 sln <- subscribeRootSubscribed subscribed sub
1570 sln <- subscribeRootSubscribed subscribed sub
1281− return (sln, subscribed)
1572+ return (sln, subscribed, occ)
1282 Nothing -> {-# SCC "missRoot" #-} do
1573 Nothing -> {-# SCC "missRoot" #-} do
1283 weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
1574 weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
1284 let !cached = rootSubscribed r
1575 let !cached = rootSubscribed r
1285 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
1576 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
1286 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1577 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1287− when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
1579+ tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1288 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
1581 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
1289− writeIORef uninitRef uninit
1582+ writeIORef uninitRef $! uninit
1583+#ifdef DEBUG_NODEIDS
1290− let subscribed = RootSubscribed
1586+ let !subscribed = RootSubscribed
1291 { rootSubscribedKey = k
1587 { rootSubscribedKey = k
1292 , rootSubscribedCachedSubscribed = cached
1588 , rootSubscribedCachedSubscribed = cached
1293− , rootSubscribedOccurrence = liftM (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
1589+ , rootSubscribedOccurrence = getOcc
1294 , rootSubscribedSubscribers = subs
1590 , rootSubscribedSubscribers = subs
1295 , rootSubscribedUninit = uninit
1591 , rootSubscribedUninit = uninit
1296 , rootSubscribedWeakSelf = weakSelf
1592 , rootSubscribedWeakSelf = weakSelf
1297#ifdef DEBUG_NODEIDS
1593#ifdef DEBUG_NODEIDS
1298− , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
1594+ , rootSubscribedNodeId = nid
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.
1605+ cs <- readIORef $ _weakBag_children subs
1606+ when (not $ IntMap.null cs) (cleanupRootSubscribed subscribed)
1301− writeIORef weakSelf =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
1607+ writeIORef weakSelf =<< evaluate =<< mkWeakPtr subscribed (Just finalCleanup)
1302− modifyIORef' (rootSubscribed r) $ DMap.insertWith (error $ "getRootSubscribed: duplicate key inserted into Root" <> showNodeId r) k subscribed --TODO: I think we can just write back mSubscribed rather than re-reading it
1608+ 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
1303− return (sln, subscribed)
1610+ return (sln, subscribed, occ)
1612+#ifdef USE_TEMPLATE_HASKELL
1613+{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1305−cleanupRootSubscribed :: RootSubscribed a -> IO ()
1615+cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1306−cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
1616+cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
1307 rootSubscribedUninit self
1617 rootSubscribedUninit self
1308 modifyIORef' cached $ DMap.delete k
1618 modifyIORef' cached $ DMap.delete k
1310{-# INLINE subscribeRootSubscribed #-}
1620{-# INLINE subscribeRootSubscribed #-}
1311−subscribeRootSubscribed :: RootSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
1621+subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1312subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
1622subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
1314−-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1624+newtype EventSelectorInt x a = EventSelectorInt { selectInt :: Int -> Event x a }
1315−{-# SPECIALIZE getPushSubscribed :: Push a b -> Subscriber b -> EventM x (SubscriberListTicket b, PushSubscribed a b) #-}
1625+
1316−getPushSubscribed :: CanSubscribe x m => Push a b -> Subscriber b -> m (SubscriberListTicket b, PushSubscribed a b)
1626+data FanInt x a = FanInt
1317−getPushSubscribed p sub = do
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
1318− mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1628+ , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
1319− case mSubscribed of
1629+ , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
1320− Just subscribed -> {-# SCC "hitPush" #-} do
1321− sln <- liftIO $ subscribePushSubscribed subscribed sub
1322− return (sln, subscribed)
1323− Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1324− subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1325− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1326− s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
1327− subscription@(_, subd) <- subscribe (pushParent p) s
1328− parentOcc <- liftIO $ readEventSubscribed subd
1329− occ <- runComputeM $ liftM join $ mapM (pushCompute p) parentOcc
1330− occRef <- liftIO $ newIORef occ
1331− when (isJust occ) $ scheduleClear occRef
1332− weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1333− let !cached = pushSubscribed p
1334− (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1335− let subscribed = PushSubscribed
1336− { pushSubscribedCachedSubscribed = cached
1337− , pushSubscribedOccurrence = occRef
1338− , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1339− , pushSubscribedSubscribers = subs
1340− , pushSubscribedSelf = s
1341− , pushSubscribedWeakSelf = weakSelf
1342− , pushSubscribedParent = subscription
1343#ifdef DEBUG_NODEIDS
1630#ifdef DEBUG_NODEIDS
1344− , pushSubscribedNodeId = unsafeNodeId p
1631+ , _fanInt_nodeId :: {-# UNPACK #-} !Int
1347− liftIO $ writeIORef weakSelf =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1634+
1348− liftIO $ writeIORef subscribedRef subscribed
1635+newFanInt :: IO (FanInt x a)
1349− liftIO $ writeIORef (pushSubscribed p) $ Just subscribed
1636+newFanInt = do
1350− return (sln, subscribed)
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
1351−
1638+ subscriptionRef <- newIORef $ error "fanInt: no subscription"
1352−cleanupPushSubscribed :: PushSubscribed a b -> IO ()
1639+ occRef <- newIORef $ error "fanInt: no occurrence"
1353−cleanupPushSubscribed self = do
1354− unsubscribe $ pushSubscribedParent self
1355− writeIORef (pushSubscribedCachedSubscribed self) Nothing
1357−{-# INLINE subscribePushSubscribed #-}
1358−subscribePushSubscribed :: PushSubscribed a b -> Subscriber b -> IO (SubscriberListTicket b)
1359−subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1361−{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge k -> Subscriber (DMap k Identity) -> EventM x (SubscriberListTicket (DMap k Identity), MergeSubscribed k) #-}
1362−getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge k -> Subscriber (DMap k Identity) -> m (SubscriberListTicket (DMap k Identity), MergeSubscribed k)
1363−getMergeSubscribed m sub = do
1364− mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1365− case mSubscribed of
1366− Just subscribed -> {-# SCC "hitMerge" #-} do
1367− sln <- liftIO $ subscribeMergeSubscribed subscribed sub
1368− return (sln, subscribed)
1369− Nothing -> {-# SCC "missMerge" #-} do
1370− subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1371− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1372− initialParents <- readBehaviorUntracked $ current $ mergeParents m
1373− subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1374− s <- liftIO $ newSubscriberMerge k subscribedUnsafe
1375− subscription@(_, parentSubd) <- subscribe e s
1376− parentOcc <- liftIO $ readEventSubscribed parentSubd
1377− height <- liftIO $ readIORef $ eventSubscribedHeightRef parentSubd
1378− return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> (MergeSubscribedParent subscription s))
1379− let dm = DMap.fromDistinctAscList $ catMaybes $ map (\(x, _, _) -> x) subscribers
1380− subscriberHeights = map (\(_, x, _) -> x) subscribers
1381− myHeight = succHeight $ foldr maxHeight zeroHeight subscriberHeights
1382− currentHeight <- getCurrentHeight
1383− let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1384− then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1386− when (not $ DMap.null accum) $ do
1387− scheduleMerge myHeight subscribedUnsafe
1388− occRef <- liftIO $ newIORef occ
1389− when (isJust occ) $ scheduleClear occRef
1390− accumRef <- liftIO $ newIORef accum
1391− heightRef <- liftIO $ newIORef myHeight
1392− weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1393− (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1394− changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1395− parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1396− let !subscribed = MergeSubscribed
1397− { mergeSubscribedCachedSubscribed = mergeSubscribed m
1398− , mergeSubscribedOccurrence = occRef
1399− , mergeSubscribedAccum = accumRef
1400− , mergeSubscribedHeight = heightRef
1401− , mergeSubscribedSubscribers = subs
1402− , mergeSubscribedChange = changeSubdRef
1403− , mergeSubscribedParents = parentsRef
1404− , mergeSubscribedWeakSelf = weakSelf
1405#ifdef DEBUG_NODEIDS
1640#ifdef DEBUG_NODEIDS
1406− , mergeSubscribedNodeId = unsafeNodeId m
1641+ nodeId <- newNodeId
1408− }
1643+ return $ FanInt
1409− defer $ SomeMergeInit subscribed $ updated $ mergeParents m
1644+ { _fanInt_subscribers = subscribers
1410− liftIO $ writeIORef subscribedRef subscribed
1645+ , _fanInt_subscriptionRef = subscriptionRef
1411− liftIO $ writeIORef weakSelf =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1646+ , _fanInt_occRef = occRef
1412− liftIO $ writeIORef (mergeSubscribed m) $ Just subscribed
1647+#ifdef DEBUG_NODEIDS
1413− return (sln, subscribed)
1648+ , _fanInt_nodeId = nodeId
1415−cleanupMergeSubscribed :: MergeSubscribed k -> IO ()
1650+ }
1416−cleanupMergeSubscribed subscribed = do
1651+
1417− parents <- readIORef $ mergeSubscribedParents subscribed
1652+fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
1418− forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1653+fanInt p = unsafePerformIO $ do
1419− -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1654+ self <- newFanInt
1420− writeIORef (mergeSubscribedCachedSubscribed subscribed) Nothing -- Get rid of the cached subscribed
1655+ pure $ EventSelectorInt $ \k -> Event $ \sub -> do
1421−
1656+ isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
1422−{-# INLINE subscribeMergeSubscribed #-}
1657+ when isEmpty $ do -- This is the first subscriber, so we need to subscribe to our input
1423−subscribeMergeSubscribed :: MergeSubscribed k -> Subscriber (DMap k Identity) -> IO (SubscriberListTicket (DMap k Identity))
1658+ let desc = "fanInt" <> showNodeId self <> ", k = " <> show k
1424−subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
1659+ (subscription, parentOcc) <- subscribeAndRead p $ debugSubscriber' desc $ Subscriber
1425−
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
1676+ writeIORef (_fanInt_subscriptionRef self) subscription
1677+ writeIORef (_fanInt_occRef self) $ fromMaybe IntMap.empty parentOcc
1678+ scheduleIntClear $ _fanInt_occRef self
1680+ b <- FastMutableIntMap.lookup (_fanInt_subscribers self) k >>= \case
1682+ b <- FastWeakBag.empty
1683+ FastMutableIntMap.insert (_fanInt_subscribers self) k b
1686+ ticket <- liftIO $ FastWeakBag.insert sub b
1687+ currentOcc <- readIORef (_fanInt_occRef self)
1689+ subscribed <- fanIntSubscribed ticket self
1690+ return (EventSubscription (FastWeakBag.remove ticket) subscribed, IntMap.lookup k currentOcc)
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)
1699+ , eventSubscribedGetParents = return [subscribedParent]
1700+ , eventSubscribedHasOwnHeightRef = False
1701+ , eventSubscribedWhoCreated = whoCreatedIORef $ _fanInt_subscriptionRef self
1706+{-# INLINABLE getFanSubscribed #-}
1426−{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan k -> Subscriber a -> EventM x (SubscriberListTicket a, FanSubscribed k) #-}
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))
1427−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)
1428getFanSubscribed k f sub = do
1708getFanSubscribed k f sub = do
1429 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
1709 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
1430 case mSubscribed of
1710 case mSubscribed of
1431− Just subscribed -> {-# SCC "hitFan" #-} do
1711+ Just subscribed -> {-# SCC "hitFan" #-} liftIO $ do
1432− sln <- liftIO $ subscribeFanSubscribed k subscribed sub
1712+ sln <- subscribeFanSubscribed k subscribed sub
1713+ occ <- readIORef $ fanSubscribedOccurrence subscribed
1433− return (sln, subscribed)
1714+ return (sln, subscribed, coerce $ DMap.lookup k =<< occ)
1434 Nothing -> {-# SCC "missFan" #-} do
1715 Nothing -> {-# SCC "missFan" #-} do
1435 subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
1716 subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
1436 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1717 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1437 s <- liftIO $ newSubscriberFan subscribedUnsafe
1718 s <- liftIO $ newSubscriberFan subscribedUnsafe
1438− subscription <- subscribe (fanParent f) s
1719+ (subscription, parentOcc) <- subscribeAndRead (fanParent f) s
1439 weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
1720 weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
1440 (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
1721 (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
1441− subscribersRef <- liftIO $ newIORef $ DMap.singleton k $ FanSubscribedChildren subsForK weakSelf
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
1442 let subscribed = FanSubscribed
1728 let subscribed = FanSubscribed
1443 { fanSubscribedCachedSubscribed = fanSubscribed f
1729 { fanSubscribedCachedSubscribed = fanSubscribed f
1730+ , fanSubscribedOccurrence = occRef
1444 , fanSubscribedParent = subscription
1731 , fanSubscribedParent = subscription
1445 , fanSubscribedSubscribers = subscribersRef
1732 , fanSubscribedSubscribers = subscribersRef
1446#ifdef DEBUG_NODEIDS
1733#ifdef DEBUG_NODEIDS
1447− , fanSubscribedNodeId = unsafeNodeId f
1734+ , fanSubscribedNodeId = nid
1450− liftIO $ writeIORef weakSelf =<< mkWeakPtrWithDebug (k, subscribed) "FanSubscribed"
1737+ let !self = (k, subscribed)
1738+ liftIO $ writeIORef subscribersRef $! DMap.singleton k $ FanSubscribedChildren subsForK self weakSelf
1739+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
1451− liftIO $ writeIORef subscribedRef subscribed
1740+ liftIO $ writeIORef subscribedRef $! subscribed
1452 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1741 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1453− return (slnForSub, subscribed)
1742+ return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
1455−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed k) -> IO ()
1744+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
1456cleanupFanSubscribed (k, subscribed) = do
1745cleanupFanSubscribed (k, subscribed) = do
1457 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1746 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1458 let reducedSubscribers = DMap.delete k subscribers
1747 let reducedSubscribers = DMap.delete k subscribers
@@ -1461,28 +1750,30 @@ cleanupFanSubscribed (k, subscribed) = do
1461 unsubscribe $ fanSubscribedParent subscribed
1750 unsubscribe $ fanSubscribedParent subscribed
1462 -- Not necessary in this case, because this whole FanSubscribed is dead: writeIORef (fanSubscribedSubscribers subscribed) reducedSubscribers
1751 -- Not necessary in this case, because this whole FanSubscribed is dead: writeIORef (fanSubscribedSubscribers subscribed) reducedSubscribers
1463 writeIORef (fanSubscribedCachedSubscribed subscribed) Nothing
1752 writeIORef (fanSubscribedCachedSubscribed subscribed) Nothing
1464− else writeIORef (fanSubscribedSubscribers subscribed) reducedSubscribers
1753+ else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
1466{-# INLINE subscribeFanSubscribed #-}
1755{-# INLINE subscribeFanSubscribed #-}
1467−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed k -> Subscriber a -> IO (SubscriberListTicket a)
1756+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
1468subscribeFanSubscribed k subscribed sub = do
1757subscribeFanSubscribed k subscribed sub = do
1469 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1758 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1470 case DMap.lookup k subscribers of
1759 case DMap.lookup k subscribers of
1471− Nothing -> do
1760+ Nothing -> {-# SCC "missSubscribeFanSubscribed" #-} do
1472− weakSelf <- newIORef =<< mkWeakPtrWithDebug (k, subscribed) "FanSubscribed"
1761+ let !self = (k, subscribed)
1762+ weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
1473 (list, sln) <- WeakBag.singleton sub weakSelf cleanupFanSubscribed
1763 (list, sln) <- WeakBag.singleton sub weakSelf cleanupFanSubscribed
1474− writeIORef (fanSubscribedSubscribers subscribed) $! DMap.insertWith (error "subscribeEventSubscribed: key that we just failed to find is present - should be impossible") k (FanSubscribedChildren list weakSelf) subscribers
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
1475 return sln
1765 return sln
1476− Just (FanSubscribedChildren list weakSelf) -> WeakBag.insert sub list weakSelf cleanupFanSubscribed
1766+ Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
1478−{-# SPECIALIZE getSwitchSubscribed :: Switch a -> Subscriber a -> EventM x (SubscriberListTicket a, SwitchSubscribed a) #-}
1768+{-# INLINABLE getSwitchSubscribed #-}
1479−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)
1769+getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1480getSwitchSubscribed s sub = do
1770getSwitchSubscribed s sub = do
1481 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
1771 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
1482 case mSubscribed of
1772 case mSubscribed of
1483− Just subscribed -> {-# SCC "hitSwitch" #-} do
1773+ Just subscribed -> {-# SCC "hitSwitch" #-} liftIO $ do
1484− sln <- liftIO $ subscribeSwitchSubscribed subscribed sub
1774+ sln <- subscribeSwitchSubscribed subscribed sub
1775+ occ <- readIORef $ switchSubscribedOccurrence subscribed
1485− return (sln, subscribed)
1776+ return (sln, subscribed, occ)
1486 Nothing -> {-# SCC "missSwitch" #-} do
1777 Nothing -> {-# SCC "missSwitch" #-} do
1487 subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
1778 subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
1488 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1779 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
@@ -1493,14 +1784,16 @@ getSwitchSubscribed s sub = do
1493 parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
1784 parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
1494 holdInits <- getDeferralQueue
1785 holdInits <- getDeferralQueue
1495 e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1786 e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1496− subscription@(_, subd) <- subscribe e mySub
1787+ (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead e mySub
1788+ heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
1497 subscriptionRef <- liftIO $ newIORef subscription
1789 subscriptionRef <- liftIO $ newIORef subscription
1498− parentOcc <- liftIO $ readEventSubscribed subd
1499 occRef <- liftIO $ newIORef parentOcc
1790 occRef <- liftIO $ newIORef parentOcc
1500 when (isJust parentOcc) $ scheduleClear occRef
1791 when (isJust parentOcc) $ scheduleClear occRef
1501− heightRef <- liftIO $ newIORef =<< readIORef (eventSubscribedHeightRef subd)
1502 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
1792 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
1503 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1793 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794+#ifdef DEBUG_NODEIDS
1795+ nid <- liftIO newNodeId
1504 let !subscribed = SwitchSubscribed
1797 let !subscribed = SwitchSubscribed
1505 { switchSubscribedCachedSubscribed = switchSubscribed s
1798 { switchSubscribedCachedSubscribed = switchSubscribed s
1506 , switchSubscribedOccurrence = occRef
1799 , switchSubscribedOccurrence = occRef
@@ -1513,39 +1806,39 @@ getSwitchSubscribed s sub = do
1513 , switchSubscribedCurrentParent = subscriptionRef
1806 , switchSubscribedCurrentParent = subscriptionRef
1514 , switchSubscribedWeakSelf = weakSelf
1807 , switchSubscribedWeakSelf = weakSelf
1515#ifdef DEBUG_NODEIDS
1808#ifdef DEBUG_NODEIDS
1516− , switchSubscribedNodeId = unsafeNodeId s
1809+ , switchSubscribedNodeId = nid
1519− liftIO $ writeIORef weakSelf =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
1812+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
1520− liftIO $ writeIORef subscribedRef subscribed
1813+ liftIO $ writeIORef subscribedRef $! subscribed
1521 liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1814 liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1522− return (slnForSub, subscribed)
1815+ return (slnForSub, subscribed, parentOcc)
1524−cleanupSwitchSubscribed :: SwitchSubscribed a -> IO ()
1817+cleanupSwitchSubscribed :: SwitchSubscribed x a -> IO ()
1525cleanupSwitchSubscribed subscribed = do
1818cleanupSwitchSubscribed subscribed = do
1526 unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
1819 unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
1527 finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
1820 finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
1528 writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
1821 writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
1530{-# INLINE subscribeSwitchSubscribed #-}
1823{-# INLINE subscribeSwitchSubscribed #-}
1531−subscribeSwitchSubscribed :: SwitchSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
1824+subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1532subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
1825subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
1534−{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence a -> Subscriber a -> EventM x (SubscriberListTicket a, CoincidenceSubscribed a) #-}
1827+{-# INLINABLE getCoincidenceSubscribed #-}
1535−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)
1828+getCoincidenceSubscribed :: forall x a. HasSpiderTimeline x => Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
1536getCoincidenceSubscribed c sub = do
1829getCoincidenceSubscribed c sub = do
1537 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
1830 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
1538 case mSubscribed of
1831 case mSubscribed of
1539− Just subscribed -> {-# SCC "hitCoincidence" #-} do
1832+ Just subscribed -> {-# SCC "hitCoincidence" #-} liftIO $ do
1540− sln <- liftIO $ subscribeCoincidenceSubscribed subscribed sub
1833+ sln <- subscribeCoincidenceSubscribed subscribed sub
1834+ occ <- readIORef $ coincidenceSubscribedOccurrence subscribed
1541− return (sln, subscribed)
1835+ return (sln, subscribed, occ)
1542 Nothing -> {-# SCC "missCoincidence" #-} do
1836 Nothing -> {-# SCC "missCoincidence" #-} do
1543 subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
1837 subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
1544 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1838 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1545 subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1839 subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1546− outerSubscription@(_, outerSubd) <- subscribe (coincidenceParent c) subOuter
1840+ (outerSubscription@(EventSubscription _ outerSubd), outerOcc) <- subscribeAndRead (coincidenceParent c) subOuter
1547− outerOcc <- liftIO $ readEventSubscribed outerSubd
1548− outerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef outerSubd
1841+ outerHeight <- liftIO $ getEventSubscribedHeight outerSubd
1549 (occ, height, mInnerSubd) <- case outerOcc of
1842 (occ, height, mInnerSubd) <- case outerOcc of
1550 Nothing -> return (Nothing, outerHeight, Nothing)
1843 Nothing -> return (Nothing, outerHeight, Nothing)
1551 Just o -> do
1844 Just o -> do
@@ -1558,6 +1851,9 @@ getCoincidenceSubscribed c sub = do
1558 scheduleClear innerSubdRef
1851 scheduleClear innerSubdRef
1559 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
1852 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
1560 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1853 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854+#ifdef DEBUG_NODEIDS
1855+ nid <- liftIO newNodeId
1561 let subscribed = CoincidenceSubscribed
1857 let subscribed = CoincidenceSubscribed
1562 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
1858 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
1563 , coincidenceSubscribedOccurrence = occRef
1859 , coincidenceSubscribedOccurrence = occRef
@@ -1568,158 +1864,552 @@ getCoincidenceSubscribed c sub = do
1568 , coincidenceSubscribedInnerParent = innerSubdRef
1864 , coincidenceSubscribedInnerParent = innerSubdRef
1569 , coincidenceSubscribedWeakSelf = weakSelf
1865 , coincidenceSubscribedWeakSelf = weakSelf
1570#ifdef DEBUG_NODEIDS
1866#ifdef DEBUG_NODEIDS
1571− , coincidenceSubscribedNodeId = unsafeNodeId c
1867+ , coincidenceSubscribedNodeId = nid
1574− liftIO $ writeIORef weakSelf =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
1870+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
1575− liftIO $ writeIORef subscribedRef subscribed
1871+ liftIO $ writeIORef subscribedRef $! subscribed
1576 liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1872 liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1577− return (slnForSub, subscribed)
1873+ return (slnForSub, subscribed, occ)
1579−cleanupCoincidenceSubscribed :: CoincidenceSubscribed a -> IO ()
1875+cleanupCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO ()
1580cleanupCoincidenceSubscribed subscribed = do
1876cleanupCoincidenceSubscribed subscribed = do
1581 unsubscribe $ coincidenceSubscribedOuterParent subscribed
1877 unsubscribe $ coincidenceSubscribedOuterParent subscribed
1582 writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
1878 writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
1584{-# INLINE subscribeCoincidenceSubscribed #-}
1880{-# INLINE subscribeCoincidenceSubscribed #-}
1585−subscribeCoincidenceSubscribed :: CoincidenceSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
1881+subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1586subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
1882subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
1588−{-# INLINE merge #-}
1884+{-# INLINE mergeG #-}
1589−merge :: GCompare k => Dynamic R.PatchDMap (DMap k Event) -> Event (DMap k Identity)
1885+mergeG :: forall k q x v. (HasSpiderTimeline x, GCompare k)
1590−merge m = EventMerge $ Merge
1886+ => (forall a. q a -> Event x (v a))
1591− { mergeParents = m
1887+ -> DynamicS x (PatchDMap k q) -> Event x (DMap k v)
1592− , mergeSubscribed = unsafeNewIORef m Nothing
1888+mergeG nt d = cacheEvent (mergeCheap nt d)
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)
1896+{-# INLINE [1] 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
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
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
1920+ liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1921+ return (maybeToList (unMergeSubscribedParent <$> mOldSubd) ++ subscriptionsToKill, newPs)
1922+ foldM f ([], oldParents) $ DMap.toList p
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
1936+ destroy :: MergeDestroyFunc k (MergeSubscribedParent x)
1937+ destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParent sub) -> unsubscribe sub
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
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
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
1963+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
1964+ _mergeSubscribedParentWithMove_subscription parent
1966+ liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1967+ return $ Just $ _mergeSubscribedParentWithMove_subscription parent
1969+ liftIO $ writeIORef (_mergeSubscribedParentWithMove_key parent) $! toKey
1971+ toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
1972+ DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
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
1988+ destroy :: MergeDestroyFunc k (MergeSubscribedParentWithMove x k)
1989+ destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParentWithMove sub _) -> unsubscribe sub
1991+type MergeUpdateFunc k v x p s
1992+ = (forall a. EventM x (k a) -> Subscriber x (v a))
1996+ -> EventM x ([EventSubscription x], DMap k s)
1998+type MergeGetSubscription x s = forall a. s a -> EventSubscription x
2000+type MergeInitFunc k v q x s
2002+ -> (forall a. EventM x (k a) -> Subscriber x (v a))
2003+ -> EventM x (DMap k v, [Height], DMap k s)
2005+type MergeDestroyFunc k s
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))
2017+invalidateMergeHeight :: Merge x k v s -> IO ()
2018+invalidateMergeHeight m = invalidateMergeHeight' (_merge_heightRef m) (_merge_sub m)
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
2028+revalidateMergeHeight :: Merge x k v s -> IO ()
2029+revalidateMergeHeight m = do
2030+ currentHeight <- readIORef $ _merge_heightRef m
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
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"
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
2055+checkCycle :: HasSpiderTimeline x => EventSubscribed x -> EventM x ()
2056+checkCycle subscribed = liftIO $ do
2057+ height <- readIORef (eventSubscribedHeightRef subscribed)
2059+ -- currentHeight <- getCurrentHeight
2060+ -- when (height <= currentHeight) $ if height /= invalidHeight
2062+ -- myStack <- liftIO $ whoCreatedIORef undefined --TODO
2063+ -- error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
2065+ when (height == invalidHeight) $
2068+ nodesInvolvedInCycle <- walkInvalidHeightParents subscribed
2069+ stacks <- forM nodesInvolvedInCycle whoCreatedEventSubscribed
2070+ throwIO (EventLoopException stacks)
2072+ throwIO EventLoopException
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
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
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
1595−newtype EventSelector k = EventSelector { select :: forall a. k a -> Event a }
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
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"
2117+ let subscribed = EventSubscribed
2118+ { eventSubscribedHeightRef = heightRef
2119+ , eventSubscribedRetained = toAny (parentsRef, changeSubdRef)
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
2130+ { _merge_parentsRef = parentsRef
2131+ , _merge_heightBagRef = heightBagRef
2132+ , _merge_heightRef = heightRef
2134+ , _merge_accumRef = accumRef
2136+ (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber subscribed m
2137+ let myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
2138+ myHeight = if invalidHeight `elem` heights
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)
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 ()
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
2166+ return (EventSubscription unsubscribeAll subscribed, occ)
2169+mergeInt :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
2170+mergeInt = cacheEvent . mergeIntCheap
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)
2185+ , eventSubscribedGetParents = fmap (_eventSubscription_subscribed . snd) <$> FastMutableIntMap.toList parents
2186+ , eventSubscribedHasOwnHeightRef = False
2187+ , eventSubscribedWhoCreated = whoCreatedIORef heightRef
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
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
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
2219+ , subscriberRecalculateHeight = \new -> do
2220+ modifyIORef' heightBagRef $ heightBagAdd new
2221+ recalculateMyHeight
2223+ forM_ (IntMap.toList initialParents) $ \(k, p) -> do
2224+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead p $ mySubscriber k
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
2232+ modifyIORef' heightBagRef $ heightBagAdd height
2233+ modifyIORef' heightRef $ \oldHeight ->
2234+ if oldHeight == 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
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
2246+ defer $ SomeMergeInit $ do
2247+ let updateMe a = SomeMergeUpdate u invalidateMyHeight recalculateMyHeight
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
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"
2267+ , subscriberInvalidateHeight = \_ -> return ()
2268+ , subscriberRecalculateHeight = \_ -> return ()
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
1597−fan :: GCompare k => Event (DMap k Identity) -> EventSelector k
2279+ return (EventSubscription unsubscribeAll subscribed, occ)
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) }
2284+fanG :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k v) -> EventSelectorG x k v
2285+fanG e = unsafePerformIO $ do
2286+ ref <- newIORef Nothing
1599 let f = Fan
2287 let f = Fan
1600 { fanParent = e
2288 { fanParent = e
1601− , fanSubscribed = unsafeNewIORef e Nothing
2289+ , fanSubscribed = ref
1603− in EventSelector $ \k -> EventFan k f
2291+ pure $ EventSelectorG $ \k -> eventFan k f
1605−{- SPECIALIZE runHoldInits :: IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> EventM x () #-}
1606−--runHoldInits :: (CanSubscribe x m, Defer SomeMergeUpdate m) => IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> m ()
1607−runHoldInits :: IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> EventM x ()
2293+runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
1608−runHoldInits holdInitRef mergeInitRef = do
2294+runHoldInits holdInitRef dynInitRef mergeInitRef = do
1609 holdInits <- liftIO $ readIORef holdInitRef
2295 holdInits <- liftIO $ readIORef holdInitRef
2296+ dynInits <- liftIO $ readIORef dynInitRef
1610 mergeInits <- liftIO $ readIORef mergeInitRef
2297 mergeInits <- liftIO $ readIORef mergeInitRef
1611− if null holdInits && null mergeInits then return () else do
2298+ unless (null holdInits && null dynInits && null mergeInits) $ do
1612 liftIO $ writeIORef holdInitRef []
2299 liftIO $ writeIORef holdInitRef []
2300+ liftIO $ writeIORef dynInitRef []
1613 liftIO $ writeIORef mergeInitRef []
2301 liftIO $ writeIORef mergeInitRef []
1614 mapM_ initHold holdInits
2302 mapM_ initHold holdInits
1615− mapM_ initMerge mergeInits
2303+ mapM_ initDyn dynInits
2304+ mapM_ unSomeMergeInit mergeInits
1616− runHoldInits holdInitRef mergeInitRef
2305+ runHoldInits holdInitRef dynInitRef mergeInitRef
1618−{- SPECIALIZE initHold :: SomeHoldInit -> EventM x () #-}
2307+initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
1619−--initHold :: CanSubscribe x m => SomeHoldInit -> m ()
1620−initHold :: SomeHoldInit -> EventM x ()
1621initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
2308initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
1623−{- SPECIALIZE initMerge :: SomeMergeInit -> EventM x () #-}
2310+initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
1624−--initMerge :: (CanSubscribe x m, Defer SomeMergeUpdate m) => SomeMergeInit -> m ()
2311+initDyn (SomeDynInit d) = void $ getDynHold d
1625−initMerge :: SomeMergeInit -> EventM x ()
1626−initMerge (SomeMergeInit subscribed changed) = do
1627− changeSub <- liftIO $ newSubscriberMergeChange subscribed
1628− (_, changeSubd) <- subscribe changed changeSub
1629− change <- liftIO $ readEventSubscribed changeSubd
1630− forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1631− liftIO $ writeIORef (mergeSubscribedChange subscribed) (changeSub, changeSubd)
1633−-- | Run an event action outside of a frame
2313+newEventEnv :: IO (EventEnv x)
1634−runFrame :: EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
2314+newEventEnv = do
1635−runFrame a = SpiderHost $ ask >>= \spiderEnv -> lift $ do
1636− -- 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
1637− pendingCleanups <- atomicModifyIORef (_spiderEnv_cleanups spiderEnv) $ \x -> ([], x)
1638− {-# SCC "cleanups" #-} sequence_ pendingCleanups
1639 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
2315 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
1640 holdInitRef <- newIORef []
2316 holdInitRef <- newIORef []
2317+ dynInitRef <- newIORef []
1641 mergeUpdateRef <- newIORef []
2318 mergeUpdateRef <- newIORef []
1642 mergeInitRef <- newIORef []
2319 mergeInitRef <- newIORef []
1643 heightRef <- newIORef zeroHeight
2320 heightRef <- newIORef zeroHeight
1644 toClearRef <- newIORef []
2321 toClearRef <- newIORef []
2322+ toClearIntRef <- newIORef []
1645 toClearRootRef <- newIORef []
2323 toClearRootRef <- newIORef []
1646 coincidenceInfosRef <- newIORef []
2324 coincidenceInfosRef <- newIORef []
1647− delayedRef <- liftIO $ newIORef IntMap.empty
2325+ delayedRef <- newIORef IntMap.empty
1648− let env = EventEnv spiderEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
2326+ return $ EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef
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
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)
1649 let go = do
2346 let go = do
1650 result <- a
2347 result <- a
1651− 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
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
1652 return result
2349 return result
1653− result <- runEventM go env
2350+ result <- runEventM go
1654− toClear <- readIORef toClearRef
2351+ toClear <- readIORef $ eventEnvClears env
1655− forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
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
1656− toClearRoot <- readIORef toClearRootRef
2355+ toClearRoot <- readIORef $ eventEnvRootClears env
1657− forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref DMap.empty
2356+ forM_ toClearRoot $ \(Some (RootClear ref)) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1658− toAssign <- readIORef toAssignRef
2357+ toAssign <- readIORef $ eventEnvAssignments env
1659 toReconnectRef <- newIORef []
2358 toReconnectRef <- newIORef []
1660− coincidenceInfos <- readIORef coincidenceInfosRef
2359+ coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
1661 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
2360 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
1662 writeIORef vRef v
2361 writeIORef vRef v
1663− when debugInvalidate $ putStrLn $ "Invalidating Hold"
2362+ traceInvalidate $ "Invalidating Hold"
1664− writeIORef iRef =<< invalidate toReconnectRef =<< readIORef iRef
2363+ writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
1665− mergeUpdates <- readIORef mergeUpdateRef
2364+ mergeUpdates <- readIORef $ eventEnvMergeUpdates env
1666− writeIORef mergeUpdateRef []
2365+ writeIORef (eventEnvMergeUpdates env) []
1667− let updateMerge :: SomeMergeUpdate -> IO [SomeEventSubscription]
2366+ tracePropagate (Proxy::Proxy x) $ "Updating merges"
1668− updateMerge (SomeMergeUpdate (R.PatchDMap p) m) = do
2367+ mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
1669− oldParents <- readIORef $ mergeSubscribedParents m
2368+ tracePropagate (Proxy::Proxy x) $ "Updating merges done"
1670− let f (subscriptionsToKill, ps) (k :=> Compose me) = do
1671− (mOldSubd, newPs) <- case me of
1672− Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1674− s <- liftIO $ newSubscriberMerge k m
1675− subscription <- subscribe e s
1676− let newParent = MergeSubscribedParent subscription s
1677− return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1678− liftIO $ invalidateMergeHeight k m
1679− return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1680− (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
1681− writeIORef (mergeSubscribedParents m) $! newParents
1682− return subscriptionsToKill
1683− mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
1684 toReconnect <- readIORef toReconnectRef
2369 toReconnect <- readIORef toReconnectRef
1685 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
2371 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
1686 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
2372 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
1687 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2373 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
1688− when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
2374+ traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1689 finalize wi
2375 finalize wi
1690 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
2376 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
1691 wi' <- mkWeakPtrWithDebug i "wi'"
2377 wi' <- mkWeakPtrWithDebug i "wi'"
1692− writeIORef (switchSubscribedOwnWeakInvalidator subscribed) wi'
2378+ writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
1693 writeIORef (switchSubscribedBehaviorParents subscribed) []
2379 writeIORef (switchSubscribedBehaviorParents subscribed) []
1694− writeIORef holdInitRef [] --TODO: Should we reuse this?
2380+ writeIORef (eventEnvHoldInits env) [] --TODO: Should we reuse this?
1695− e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
2381+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) $ eventEnvHoldInits env
1696− 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
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
1697 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
2383 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
1698 sub <- newSubscriberSwitch subscribed
2384 sub <- newSubscriberSwitch subscribed
1699− subscription@(_, subd') <- 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
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
1701− stackTrace <- liftIO $ liftM renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2387+ stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
1702− liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
2388+ liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1703 EventRoot _ -> "EventRoot"
2389 EventRoot _ -> "EventRoot"
1704 EventNever -> "EventNever"
2390 EventNever -> "EventNever"
1705 _ -> "something else"
2391 _ -> "something else"
1707− writeIORef (switchSubscribedCurrentParent subscribed) subscription
2393+ writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
1708− parentHeight <- readIORef $ eventSubscribedHeightRef subd'
2394+ return oldSubscription
2395+ liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
2396+ liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
2397+ forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
2398+ EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
2399+ parentHeight <- getEventSubscribedHeight subd'
1709 myHeight <- readIORef $ switchSubscribedHeight subscribed
2400 myHeight <- readIORef $ switchSubscribedHeight subscribed
1710 when (parentHeight /= myHeight) $ do
2401 when (parentHeight /= myHeight) $ do
1711− writeIORef (switchSubscribedHeight subscribed) parentHeight
2402+ writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1712− WeakBag.traverse (switchSubscribedSubscribers subscribed) invalidateSubscriberHeight
2403+ WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1713− return $ SomeEventSubscription oldSubscription
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
1714 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
2405 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
1715 unsubscribe subscription
2406 unsubscribe subscription
1716 mapM_ invalidateCoincidenceHeight mcs
2407 mapM_ invalidateCoincidenceHeight mcs
1717− forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1718− forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1719 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
2408 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
1720− forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> recalculateMergeHeight m
2409+ mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
1721 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
2410 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
1722− WeakBag.traverse (switchSubscribedSubscribers subscribed) recalculateSubscriberHeight
2411+ height <- calculateSwitchHeight subscribed
2412+ updateSwitchHeight height subscribed
1723 return result
2413 return result
1725newtype Height = Height { unHeight :: Int } deriving (Show, Read, Eq, Ord, Bounded)
2415newtype Height = Height { unHeight :: Int } deriving (Show, Read, Eq, Ord, Bounded)
@@ -1732,10 +2422,12 @@ zeroHeight = Height 0
1732invalidHeight :: Height
2422invalidHeight :: Height
1733invalidHeight = Height (-1000)
2423invalidHeight = Height (-1000)
1735-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
2426-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
1736{-# INLINE invalidHeightBeingTraversed #-}
2427{-# INLINE invalidHeightBeingTraversed #-}
1737invalidHeightBeingTraversed :: Height
2428invalidHeightBeingTraversed :: Height
1738invalidHeightBeingTraversed = Height (-1001)
2429invalidHeightBeingTraversed = Height (-1001)
1740{-# INLINE succHeight #-}
2432{-# INLINE succHeight #-}
1741succHeight :: Height -> Height
2433succHeight :: Height -> Height
@@ -1744,142 +2436,42 @@ succHeight h@(Height a) =
1744 then invalidHeight
2436 then invalidHeight
1745 else Height $ succ a
2437 else Height $ succ a
1747−-- Get the maximum height; if either of the inputs is invalid, the output will also be invalid
2439+invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1748−{-# INLINE maxHeight #-}
1749−maxHeight :: Height -> Height -> Height
1750−maxHeight ha@(Height a) hb@(Height b) =
1751− if ha == invalidHeight || hb == invalidHeight
1753− else Height $ max a b
1755−invalidateSubscriberHeight :: Subscriber a -> IO ()
1756−invalidateSubscriberHeight s = case s of
1757− SubscriberPush _ subscribed -> do
1758− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1759− WeakBag.traverse (pushSubscribedSubscribers subscribed) invalidateSubscriberHeight
1760− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1761− SubscriberMerge k subscribed -> do
1762− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1763− invalidateMergeHeight k subscribed
1764− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1765− SubscriberMergeChange _ -> return () -- Doesn't affect the height of the merge, because its changes are delayed
1766− SubscriberFan subscribed -> do
1767− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1768− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1769− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) invalidateSubscriberHeight
1770− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1771− SubscriberHold _ -> return ()
1772− SubscriberHoldIdentity _ -> return ()
1773− SubscriberSwitch subscribed -> do
1774− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1775− oldHeight <- readIORef $ switchSubscribedHeight subscribed
1776− when (oldHeight /= invalidHeight) $ do
1777− writeIORef (switchSubscribedHeight subscribed) invalidHeight
1778− WeakBag.traverse (switchSubscribedSubscribers subscribed) invalidateSubscriberHeight
1779− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1780− SubscriberCoincidenceOuter subscribed -> do
1781− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1782− invalidateCoincidenceHeight subscribed
1783− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1784− SubscriberCoincidenceInner subscribed -> do
1785− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1786− invalidateCoincidenceHeight subscribed
1787− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1788− SubscriberHandle -> return ()
1790−--TODO: Actually use the key
1791−invalidateMergeHeight :: k a -> MergeSubscribed k -> IO ()
1792−invalidateMergeHeight _ subscribed = do
1793− oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1794− when (oldHeight /= invalidHeight) $ do
1795− writeIORef (mergeSubscribedHeight subscribed) invalidHeight
1796− WeakBag.traverse (mergeSubscribedSubscribers subscribed) invalidateSubscriberHeight
1798−recalculateMergeHeight :: MergeSubscribed k -> IO ()
1799−recalculateMergeHeight subscribed = do
1800− oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1801− when (oldHeight == invalidHeight) $ do
1802− height <- calculateMergeHeight subscribed
1803− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1804− when (height /= invalidHeight) $ do -- If height == invalidHeight, that means some of the prereqs have not yet been recomputed; when they do recompute, they'll catch this node again --TODO: this is O(n*m), where n is the number of children of this noe and m is the number that have been invalidated
1805− writeIORef (mergeSubscribedHeight subscribed) height
1806− WeakBag.traverse (mergeSubscribedSubscribers subscribed) recalculateSubscriberHeight
1808−invalidateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
1809invalidateCoincidenceHeight subscribed = do
2440invalidateCoincidenceHeight subscribed = do
1810 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
2441 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
1811 when (oldHeight /= invalidHeight) $ do
2442 when (oldHeight /= invalidHeight) $ do
1812− writeIORef (coincidenceSubscribedHeight subscribed) invalidHeight
2443+ writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
1813− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) invalidateSubscriberHeight
2444+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1815−--TODO: The recalculation algorithm seems a bit funky; make sure it doesn't miss stuff or hit stuff twice; also, it should probably be lazy
2446+updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
1816−
2447+updateSwitchHeight new subscribed = do
1817−recalculateSubscriberHeight :: Subscriber a -> IO ()
2448+ oldHeight <- readIORef $ switchSubscribedHeight subscribed
1818−recalculateSubscriberHeight s = case s of
2449+ when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1819− SubscriberPush _ subscribed -> do
2450+ when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1820− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
2451+ writeIORef (switchSubscribedHeight subscribed) $! new
1821− WeakBag.traverse (pushSubscribedSubscribers subscribed) recalculateSubscriberHeight
2452+ WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1822− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
2453+
1823− SubscriberMerge _ subscribed -> do
2454+recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1824− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1825− recalculateMergeHeight subscribed
1826− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1827− SubscriberMergeChange _ -> return ()
1828− SubscriberFan subscribed -> do
1829− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1830− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1831− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) recalculateSubscriberHeight
1832− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1833− SubscriberHold _ -> return ()
1834− SubscriberHoldIdentity _ -> return ()
1835− SubscriberSwitch subscribed -> do
1836− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1837− oldHeight <- readIORef $ switchSubscribedHeight subscribed
1838− when (oldHeight == invalidHeight) $ do
1839− height <- calculateSwitchHeight subscribed
1840− when (height /= invalidHeight) $ do
1841− writeIORef (switchSubscribedHeight subscribed) height
1842− WeakBag.traverse (switchSubscribedSubscribers subscribed) recalculateSubscriberHeight
1843− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1844− SubscriberCoincidenceOuter subscribed -> do
1845− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1846− recalculateCoincidenceHeight subscribed
1847− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1848− SubscriberCoincidenceInner subscribed -> do
1849− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1850− recalculateCoincidenceHeight subscribed
1851− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1852− SubscriberHandle -> return ()
1854−recalculateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
1855recalculateCoincidenceHeight subscribed = do
2455recalculateCoincidenceHeight subscribed = do
1856 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
2456 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
1857− when (oldHeight == invalidHeight) $ do
2457+ when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1858 height <- calculateCoincidenceHeight subscribed
2458 height <- calculateCoincidenceHeight subscribed
1859 when (height /= invalidHeight) $ do
2459 when (height /= invalidHeight) $ do
1860− writeIORef (coincidenceSubscribedHeight subscribed) height
2460+ writeIORef (coincidenceSubscribedHeight subscribed) $! height
1861− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) recalculateSubscriberHeight --TODO: This should probably be mandatory, just like with the merge and switch ones
2461+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1863−calculateMergeHeight :: MergeSubscribed k -> IO Height
2463+calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
1864−calculateMergeHeight subscribed = do
2464+calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
1865− parents <- readIORef $ mergeSubscribedParents subscribed
1866− if DMap.null parents then return zeroHeight else do
1867− heights <- forM (DMap.toList parents) $ \(_ :=> es) -> do
1868− readIORef $ eventSubscribedHeightRef $ snd $ mergeSubscribedParentSubscription es
1869− return $ succHeight $ foldr maxHeight zeroHeight heights
1871−calculateSwitchHeight :: SwitchSubscribed a -> IO Height
2466+calculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO Height
1872−calculateSwitchHeight subscribed = readIORef . eventSubscribedHeightRef . snd =<< readIORef (switchSubscribedCurrentParent subscribed)
1874−calculateCoincidenceHeight :: CoincidenceSubscribed a -> IO Height
1875calculateCoincidenceHeight subscribed = do
2467calculateCoincidenceHeight subscribed = do
1876− outerHeight <- readIORef $ eventSubscribedHeightRef $ snd $ coincidenceSubscribedOuterParent subscribed
2468+ outerHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1877− innerHeight <- maybe (return zeroHeight) (readIORef . eventSubscribedHeightRef) =<< readIORef (coincidenceSubscribedInnerParent subscribed)
2469+ innerHeight <- maybe (return zeroHeight) getEventSubscribedHeight =<< readIORef (coincidenceSubscribedInnerParent subscribed)
1878 return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
2470 return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
1880−data SomeSwitchSubscribed = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed a)
2472+data SomeSwitchSubscribed x = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed x a)
1882−invalidate :: IORef [SomeSwitchSubscribed] -> WeakList Invalidator -> IO (WeakList Invalidator)
2474+invalidate :: IORef [SomeSwitchSubscribed x] -> WeakList (Invalidator x) -> IO (WeakList (Invalidator x))
1883invalidate toReconnectRef wis = do
2475invalidate toReconnectRef wis = do
1884 forM_ wis $ \wi -> do
2476 forM_ wis $ \wi -> do
1885 mi <- deRefWeak wi
2477 mi <- deRefWeak wi
@@ -1895,7 +2487,7 @@ invalidate toReconnectRef wis = do
1895 mVal <- readIORef $ pullValue p
2487 mVal <- readIORef $ pullValue p
1896 forM_ mVal $ \val -> do
2488 forM_ mVal $ \val -> do
1897 writeIORef (pullValue p) Nothing
2489 writeIORef (pullValue p) Nothing
1898− writeIORef (pullSubscribedInvalidators val) =<< invalidate toReconnectRef =<< readIORef (pullSubscribedInvalidators val)
2490+ writeIORef (pullSubscribedInvalidators val) =<< evaluate =<< invalidate toReconnectRef =<< readIORef (pullSubscribedInvalidators val)
1899 InvalidatorSwitch subscribed -> do
2491 InvalidatorSwitch subscribed -> do
1900 traceInvalidate $ "invalidate: Switch" <> showNodeId subscribed
2492 traceInvalidate $ "invalidate: Switch" <> showNodeId subscribed
1901 modifyIORef' toReconnectRef (SomeSwitchSubscribed subscribed :)
2493 modifyIORef' toReconnectRef (SomeSwitchSubscribed subscribed :)
@@ -1905,166 +2497,329 @@ invalidate toReconnectRef wis = do
1905-- Reflex integration
2497-- Reflex integration
1906--------------------------------------------------------------------------------
2498--------------------------------------------------------------------------------
1908−type Spider = SpiderEnv Global
2500+-- | Designates the default, global Spider timeline
1909−
2501+data SpiderTimeline x
1910−data Global
2502+type role SpiderTimeline nominal
1912−{-# NOINLINE globalSpiderEnv #-}
1913−globalSpiderEnv :: SpiderEnv Global
1914−globalSpiderEnv = unsafePerformIO unsafeNewSpiderEnv
1916−type role SpiderEnv nominal
1917−data SpiderEnv x = SpiderEnv
1918− { _spiderEnv_toUnsubscribe :: !(IORef [SomeEventSubscription])
1919− , _spiderEnv_lock :: !(MVar ())
1920− , _spiderEnv_cleanups :: !(IORef [IO ()])
1922− , _spiderEnv_depth :: !(IORef Int)
1926−instance GEq SpiderEnv where
1927− a `geq` b = if _spiderEnv_toUnsubscribe a == _spiderEnv_toUnsubscribe b
1928− then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderEnv can't have two different 'x' arguments
1931−unsafeNewSpiderEnv :: forall x. IO (SpiderEnv x)
1932−unsafeNewSpiderEnv = do
1933− toUnsubscribe <- newIORef []
1935− cleanups <- newIORef []
1937− depthRef <- newIORef 0
1940− { _spiderEnv_toUnsubscribe = toUnsubscribe
1941− , _spiderEnv_lock = lock
1942− , _spiderEnv_cleanups = cleanups
1944− , _spiderEnv_depth = depthRef
1948−newSpiderEnv :: IO (Some SpiderEnv)
1949−newSpiderEnv = Some.This <$> unsafeNewSpiderEnv
1951−newtype SpiderPullM x a = SpiderPullM { runSpiderPullM :: BehaviorM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1953−newtype SpiderPushM x a = SpiderPushM { runSpiderPushM :: ComputeM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2504+-- | The default, global Spider environment
1954−
2505+type Spider = SpiderTimeline Global
1955−instance R.Reflex (SpiderEnv x) where
1956− newtype Behavior (SpiderEnv x) a = SpiderBehavior { unSpiderBehavior :: Behavior a }
1957− newtype Event (SpiderEnv x) a = SpiderEvent { unSpiderEvent :: Event a }
1958− newtype Dynamic (SpiderEnv x) a = SpiderDynamic { unSpiderDynamic :: Dynamic Identity a } deriving (Functor, Applicative, Monad)
1959− newtype Incremental (SpiderEnv x) p a = SpiderIncremental { unSpiderIncremental :: Dynamic p a }
1960− type PullM (SpiderEnv x) = SpiderPullM x
1961− type PushM (SpiderEnv x) = SpiderPushM x
1962− {-# INLINABLE never #-}
1963− never = SpiderEvent EventNever
1964− {-# INLINABLE constant #-}
1965− constant = SpiderBehavior . BehaviorConst
1966− {-# INLINABLE push #-}
1967− push f = SpiderEvent . push (coerce f) . unSpiderEvent
1968− {-# INLINABLE pull #-}
1969− pull = SpiderBehavior . pull . coerce
1970− {-# INLINABLE merge #-}
1971− merge = SpiderEvent . merge . DynamicConst . (unsafeCoerce :: DMap k (R.Event (SpiderEnv x)) -> DMap k Event)
1972− {-# INLINABLE fan #-}
1973− fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
1974− {-# INLINABLE switch #-}
1975− switch = SpiderEvent . switch . (unsafeCoerce :: Behavior (R.Event (SpiderEnv x) a) -> Behavior (Event a)) . unSpiderBehavior
1976− {-# INLINABLE coincidence #-}
1977− coincidence = SpiderEvent . coincidence . (unsafeCoerce :: Event (R.Event (SpiderEnv x) a) -> Event (Event a)) . unSpiderEvent
1978− {-# INLINABLE current #-}
1979− current = SpiderBehavior . current . unSpiderDynamic
1980− {-# INLINABLE updated #-}
1981− updated = SpiderEvent . fmap runIdentity . updated . unSpiderDynamic
1982− {-# INLINABLE unsafeBuildDynamic #-}
1983− unsafeBuildDynamic readV0 v' = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (coerce readV0) $ addIdentity $ unSpiderEvent v'
1984− {-# INLINABLE unsafeBuildIncremental #-}
1985− unsafeBuildIncremental readV0 dv = SpiderIncremental $ DynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
1986− {-# INLINABLE mergeIncremental #-}
1987− mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic R.PatchDMap (DMap k (R.Event (SpiderEnv x))) -> Dynamic R.PatchDMap (DMap k Event)) . unSpiderIncremental
1988− {-# INLINABLE currentIncremental #-}
1989− currentIncremental = SpiderBehavior . current . unSpiderIncremental
1990− {-# INLINABLE updatedIncremental #-}
1991− updatedIncremental = SpiderEvent . updated . unSpiderIncremental
1992− {-# INLINABLE incrementalToDynamic #-}
1993− incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ current i) $ flip push (updated i) $ \p -> do
1994− c <- readBehaviorUntracked $ current i
1995− return $ fmap Identity $ R.apply p c --TODO: Avoid the redundant 'apply'
1997−instance R.MonadSample (SpiderEnv x) (EventM x) where
2507+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
1998 {-# INLINABLE sample #-}
2508 {-# INLINABLE sample #-}
1999 sample (SpiderBehavior b) = readBehaviorUntracked b
2509 sample (SpiderBehavior b) = readBehaviorUntracked b
2001−instance R.MonadHold (SpiderEnv x) (EventM x) where
2511+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (EventM x) where
2002 {-# INLINABLE hold #-}
2512 {-# INLINABLE hold #-}
2003 hold = holdSpiderEventM
2513 hold = holdSpiderEventM
2004 {-# INLINABLE holdDyn #-}
2514 {-# INLINABLE holdDyn #-}
2005 holdDyn = holdDynSpiderEventM
2515 holdDyn = holdDynSpiderEventM
2006 {-# INLINABLE holdIncremental #-}
2516 {-# INLINABLE holdIncremental #-}
2007 holdIncremental = holdIncrementalSpiderEventM
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
2526+instance Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
2527+ {-# INLINABLE sample #-}
2528+ sample = coerce . readBehaviorTracked . unSpiderBehavior
2530+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531+ {-# INLINABLE sample #-}
2532+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
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
2550+instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
2551+ {-# INLINE return #-}
2553+ {-# INLINE (>>=) #-}
2554+ x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
2555+ {-# INLINE (>>) #-}
2557+#if !MIN_VERSION_base(4,13,0)
2558+ {-# INLINE fail #-}
2559+ fail _ = error "Dynamic does not support 'fail'"
2562+{-# INLINABLE newJoinDyn #-}
2563+newJoinDyn :: HasSpiderTimeline x => DynamicS x (Identity (DynamicS x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
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'
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
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 #-}
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)
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
2009−holdSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Behavior (SpiderEnv x) a)
2589+holdSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Behavior (SpiderTimeline x) a)
2010−holdSpiderEventM v0 e = liftM (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2590+holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2012−holdDynSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Dynamic (SpiderEnv x) a)
2592+holdDynSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2013−holdDynSpiderEventM v0 e = liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2593+holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2015−holdIncrementalSpiderEventM :: R.Patch p => a -> R.Event (SpiderEnv x) (p a) -> EventM x (R.Incremental (SpiderEnv x) p a)
2595+holdIncrementalSpiderEventM :: (HasSpiderTimeline x, Patch p) => PatchTarget p -> Reflex.Class.Event (SpiderTimeline x) p -> EventM x (Reflex.Class.Incremental (SpiderTimeline x) p)
2016−holdIncrementalSpiderEventM v0 e = liftM (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2596+holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2018−instance R.MonadHold (SpiderEnv x) (SpiderHost x) where
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
2601+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
2019 {-# INLINABLE hold #-}
2602 {-# INLINABLE hold #-}
2020− hold v0 e = R.runHostFrame $ R.hold v0 e
2603+ hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
2021 {-# INLINABLE holdDyn #-}
2604 {-# INLINABLE holdDyn #-}
2022− holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
2605+ holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
2023 {-# INLINABLE holdIncremental #-}
2606 {-# INLINABLE holdIncremental #-}
2024− holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
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
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
2026−instance R.MonadSample (SpiderEnv x) (SpiderHost x) where
2619+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2620+ {-# INLINABLE hold #-}
2621+ hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2622+ {-# INLINABLE holdDyn #-}
2623+ holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2624+ {-# INLINABLE holdIncremental #-}
2625+ holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2626+ {-# INLINABLE buildDynamic #-}
2627+ buildDynamic getV0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
2628+ {-# INLINABLE headE #-}
2629+ headE = R.slowHeadE
2630+-- headE (SpiderEvent e) = SpiderHostFrame $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2631+ {-# INLINABLE now #-}
2632+ now = SpiderHostFrame Reflex.Class.now
2634+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
2027 {-# INLINABLE sample #-}
2635 {-# INLINABLE sample #-}
2028 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
2636 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
2030−instance R.MonadSample (SpiderEnv x) (SpiderPullM x) where
2638+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2031− {-# INLINABLE sample #-}
2032− sample = coerce . readBehaviorTracked . unSpiderBehavior
2034−instance R.MonadSample (SpiderEnv x) (SpiderPushM x) where
2035 {-# INLINABLE sample #-}
2639 {-# INLINABLE sample #-}
2036− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2640+ sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
2038−instance R.MonadHold (SpiderEnv x) (SpiderPushM x) where
2642+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2039 {-# INLINABLE hold #-}
2643 {-# INLINABLE hold #-}
2040− hold v0 e = R.current <$> R.holdDyn v0 e
2644+ hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
2041 {-# INLINABLE holdDyn #-}
2645 {-# INLINABLE holdDyn #-}
2042− holdDyn v0 (SpiderEvent e) = SpiderPushM $ liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity e
2646+ holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
2043 {-# INLINABLE holdIncremental #-}
2647 {-# INLINABLE holdIncremental #-}
2044− holdIncremental v0 (SpiderEvent e) = SpiderPushM $ liftM (SpiderIncremental . DynamicHold) $ hold v0 e
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
2046−data RootTrigger a = forall k. GCompare k => RootTrigger (SubscriberList a, IORef (DMap k Identity), k a)
2656+--------------------------------------------------------------------------------
2047−newtype SpiderEventHandle a = SpiderEventHandle { unSpiderEventHandle :: EventSubscription a }
2657+-- Deprecated items
2658+--------------------------------------------------------------------------------
2049−instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHostFrame x) where
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
2050 {-# INLINABLE subscribeEvent #-}
2664 {-# INLINABLE subscribeEvent #-}
2051 subscribeEvent e = SpiderHostFrame $ do
2665 subscribeEvent e = SpiderHostFrame $ do
2052− subscription <- subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2666+ --TODO: Unsubscribe eventually (manually and/or with weak ref)
2053− return $ SpiderEventHandle subscription
2667+ val <- liftIO $ newIORef Nothing
2054−
2668+ subscription <- subscribe (unSpiderEvent e) $ Subscriber
2055−instance R.ReflexHost (SpiderEnv x) where
2669+ { subscriberPropagate = \a -> do
2056− type EventTrigger (SpiderEnv x) = RootTrigger
2670+ liftIO $ writeIORef val $ Just a
2057− type EventHandle (SpiderEnv x) = SpiderEventHandle
2671+ scheduleClear val
2058− type HostFrame (SpiderEnv x) = SpiderHostFrame x
2672+ , subscriberInvalidateHeight = \_ -> return ()
2059−
2673+ , subscriberRecalculateHeight = \_ -> return ()
2060−instance R.MonadReadEvent (SpiderEnv x) (ReadPhase x) where
2674+ }
2061− {-# INLINABLE readEvent #-}
2675+ return $ SpiderEventHandle
2062− readEvent h = ReadPhase $ liftM (fmap return) $ liftIO $ do
2676+ { spiderEventHandleSubscription = subscription
2063− let (sln, subscribed) = unSpiderEventHandle h
2677+ , spiderEventHandleValue = val
2064− result <- readEventSubscribed subscribed
2678+ }
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
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
2066 return result
2690 return result
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
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
2704+instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHost x) where
2705+ {-# INLINABLE subscribeEvent #-}
2706+ subscribeEvent = runFrame . runSpiderHostFrame . Reflex.Host.Class.subscribeEvent
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
2713+unsafeNewSpiderTimelineEnv :: forall x. IO (SpiderTimelineEnv x)
2714+unsafeNewSpiderTimelineEnv = do
2718+ depthRef <- newIORef 0
2720+ return $ STE $ SpiderTimelineEnv
2721+ { _spiderTimeline_lock = lock
2722+ , _spiderTimeline_eventEnv = env
2724+ , _spiderTimeline_depth = depthRef
2728+-- | Create a new SpiderTimelineEnv
2729+newSpiderTimeline :: IO (Some SpiderTimelineEnv)
2730+newSpiderTimeline = withSpiderTimeline (pure . Some)
2732+data LocalSpiderTimeline (x :: Type) s
2734+instance Reifies s (SpiderTimelineEnv x) =>
2735+ HasSpiderTimeline (LocalSpiderTimeline x s) where
2736+ spiderTimeline = localSpiderTimeline Proxy $ reflect (Proxy :: Proxy s)
2740+ -> SpiderTimelineEnv x
2741+ -> SpiderTimelineEnv (LocalSpiderTimeline x s)
2742+localSpiderTimeline _ = coerce
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
2750+newtype SpiderPullM (x :: Type) a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2752+type ComputeM = EventM
2754+newtype SpiderPushM (x :: Type) a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
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 #-}
2778+ :: forall k2 (k :: k2 -> *) q (v :: k2 -> *). GCompare k
2779+ => (forall a. q a -> R.Event (SpiderTimeline x) (v a))
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))
2816+data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
2818+data SpiderEventHandle x a = SpiderEventHandle
2819+ { spiderEventHandleSubscription :: EventSubscription x
2820+ , spiderEventHandleValue :: IORef (Maybe a)
2068instance MonadRef (EventM x) where
2823instance MonadRef (EventM x) where
2069 type Ref (EventM x) = Ref IO
2824 type Ref (EventM x) = Ref IO
2070 {-# INLINABLE newRef #-}
2825 {-# INLINABLE newRef #-}
@@ -2078,7 +2833,8 @@ instance MonadAtomicRef (EventM x) where
2078 {-# INLINABLE atomicModifyRef #-}
2833 {-# INLINABLE atomicModifyRef #-}
2079 atomicModifyRef r f = liftIO $ atomicModifyRef r f
2834 atomicModifyRef r f = liftIO $ atomicModifyRef r f
2081−newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
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)
2083instance Monad (SpiderHost x) where
2839instance Monad (SpiderHost x) where
2084 {-# INLINABLE (>>=) #-}
2840 {-# INLINABLE (>>=) #-}
@@ -2087,13 +2843,27 @@ instance Monad (SpiderHost x) where
2087 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
2843 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
2088 {-# INLINABLE return #-}
2844 {-# INLINABLE return #-}
2089 return x = SpiderHost $ return x
2845 return x = SpiderHost $ return x
2846+#if !MIN_VERSION_base(4,13,0)
2847+ {-# INLINABLE fail #-}
2848+ fail = MonadFail.fail
2851+instance MonadFail (SpiderHost x) where
2090 {-# INLINABLE fail #-}
2852 {-# INLINABLE fail #-}
2091− fail s = SpiderHost $ fail s
2853+ fail s = SpiderHost $ MonadFail.fail s
2855+-- | Run an action affecting the global Spider timeline; this will be guarded by
2856+-- a mutex for that timeline
2093runSpiderHost :: SpiderHost Global a -> IO a
2857runSpiderHost :: SpiderHost Global a -> IO a
2094−runSpiderHost (SpiderHost a) = runReaderT a globalSpiderEnv
2858+runSpiderHost (SpiderHost a) = a
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
2096−newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2865+newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866+ deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2098instance Monad (SpiderHostFrame x) where
2868instance Monad (SpiderHostFrame x) where
2099 {-# INLINABLE (>>=) #-}
2869 {-# INLINABLE (>>=) #-}
@@ -2102,30 +2872,21 @@ instance Monad (SpiderHostFrame x) where
2102 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
2872 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
2103 {-# INLINABLE return #-}
2873 {-# INLINABLE return #-}
2104 return x = SpiderHostFrame $ return x
2874 return x = SpiderHostFrame $ return x
2875+#if !MIN_VERSION_base(4,13,0)
2105 {-# INLINABLE fail #-}
2876 {-# INLINABLE fail #-}
2106 fail s = SpiderHostFrame $ fail s
2877 fail s = SpiderHostFrame $ fail s
2108−instance R.MonadSample (SpiderEnv x) (SpiderHostFrame x) where
2880+instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2109− sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2881+ notReadyUntil _ = pure ()
2110−
2882+ notReady = pure ()
2111−addIdentity :: Event a -> Event (Identity a)
2112−--addIdentity = fmap Identity
2113−addIdentity = unsafeCoerce
2115−instance R.MonadHold (SpiderEnv x) (SpiderHostFrame x) where
2116− {-# INLINABLE hold #-}
2117− hold v0 e = SpiderHostFrame $ liftM (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2118− {-# INLINABLE holdDyn #-}
2119− holdDyn v0 e = SpiderHostFrame $ liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2120− {-# INLINABLE holdIncremental #-}
2121− holdIncremental v0 e = SpiderHostFrame $ liftM (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2123−newEventWithTriggerIO :: forall a. (RootTrigger a -> IO (IO ())) -> IO (Event a)
2884+newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2124newEventWithTriggerIO f = do
2885newEventWithTriggerIO f = do
2125 es <- newFanEventWithTriggerIO $ \Refl -> f
2886 es <- newFanEventWithTriggerIO $ \Refl -> f
2126 return $ select es Refl
2887 return $ select es Refl
2128−newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger a -> IO (IO ())) -> IO (EventSelector k)
2889+newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2129newFanEventWithTriggerIO f = do
2890newFanEventWithTriggerIO f = do
2130 occRef <- newIORef DMap.empty
2891 occRef <- newIORef DMap.empty
2131 subscribedRef <- newIORef DMap.empty
2892 subscribedRef <- newIORef DMap.empty
@@ -2134,47 +2895,9 @@ newFanEventWithTriggerIO f = do
2134 , rootSubscribed = subscribedRef
2895 , rootSubscribed = subscribedRef
2135 , rootInit = f
2896 , rootInit = f
2137− return $ EventSelector $ \k -> EventRoot k r
2898+ return $ EventSelector $ \k -> eventRoot k r
2139−instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHost x) where
2140− newEventWithTrigger = SpiderHost . lift . liftM SpiderEvent . newEventWithTriggerIO
2141− newFanEventWithTrigger f = SpiderHost $ lift $ do
2142− es <- newFanEventWithTriggerIO f
2143− return $ R.EventSelector $ SpiderEvent . select es
2145−instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHostFrame x) where
2146− newEventWithTrigger = SpiderHostFrame . EventM . liftIO . liftM SpiderEvent . newEventWithTriggerIO
2147− newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2148− es <- newFanEventWithTriggerIO f
2149− return $ R.EventSelector $ SpiderEvent . select es
2151−instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHost x) where
2152− {-# INLINABLE subscribeEvent #-}
2153− subscribeEvent = subscribeEventSpiderHost
2155−subscribeEventSpiderHost :: R.Event (SpiderEnv x) a -> SpiderHost x (R.EventHandle (SpiderEnv x) a)
2156−subscribeEventSpiderHost e = do
2157− subscription <- runFrame $ getEventSubscribed (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2158− return $ SpiderEventHandle subscription
2160−newtype ReadPhase x a = ReadPhase { runReadPhase :: ResultM x a } deriving (Functor, Applicative, Monad, MonadFix)
2162−instance R.MonadSample (SpiderEnv x) (ReadPhase x) where
2163− {-# INLINABLE sample #-}
2164− sample = ReadPhase . R.sample
2166−instance R.MonadHold (SpiderEnv x) (ReadPhase x) where
2900+newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
2167− {-# INLINABLE hold #-}
2168− hold v0 e = ReadPhase $ R.hold v0 e
2169− {-# INLINABLE holdDyn #-}
2170− holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2171− {-# INLINABLE holdIncremental #-}
2172− holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2174−instance R.MonadReflexHost (SpiderEnv x) (SpiderHost x) where
2175− type ReadPhase (SpiderHost x) = ReadPhase x
2176− fireEventsAndRead es (ReadPhase a) = run es a
2177− runHostFrame = runFrame . runSpiderHostFrame
2179instance MonadRef (SpiderHost x) where
2902instance MonadRef (SpiderHost x) where
2180 type Ref (SpiderHost x) = Ref IO
2903 type Ref (SpiderHost x) = Ref IO
@@ -2193,3 +2916,15 @@ instance MonadRef (SpiderHostFrame x) where
2194instance MonadAtomicRef (SpiderHostFrame x) where
2917instance MonadAtomicRef (SpiderHostFrame x) where
2195 atomicModifyRef r = SpiderHostFrame . atomicModifyRef r
2918 atomicModifyRef r = SpiderHostFrame . atomicModifyRef r
2920+instance PrimMonad (SpiderHostFrame x) where
2921+ type PrimState (SpiderHostFrame x) = PrimState IO
2922+ primitive = SpiderHostFrame . EventM . primitive
2924+instance NotReady (SpiderTimeline x) (SpiderHost x) where
2925+ notReadyUntil _ = return ()
2926+ notReady = return ()
2928+instance HasSpiderTimeline x => NotReady (SpiderTimeline x) (PerformEventT (SpiderTimeline x) (SpiderHost x)) where
2929+ notReadyUntil _ = return ()
2930+ notReady = return ()