@@ -9,125 +9,70 @@
9{-# LANGUAGE GADTs #-}
9{-# LANGUAGE GADTs #-}
10{-# LANGUAGE GeneralizedNewtypeDeriving #-}
10{-# LANGUAGE GeneralizedNewtypeDeriving #-}
11{-# LANGUAGE LambdaCase #-}
11{-# LANGUAGE LambdaCase #-}
12+{-# LANGUAGE MagicHash #-}
13+{-# LANGUAGE MultiParamTypeClasses #-}
14+{-# LANGUAGE MultiWayIf #-}
12{-# LANGUAGE RankNTypes #-}
15{-# LANGUAGE RankNTypes #-}
16+{-# LANGUAGE RecursiveDo #-}
13{-# LANGUAGE RoleAnnotations #-}
17{-# LANGUAGE RoleAnnotations #-}
14{-# LANGUAGE ScopedTypeVariables #-}
18{-# LANGUAGE ScopedTypeVariables #-}
15{-# LANGUAGE TypeFamilies #-}
19{-# LANGUAGE TypeFamilies #-}
16{-# LANGUAGE TypeOperators #-}
20{-# LANGUAGE TypeOperators #-}
21+{-# LANGUAGE UnboxedTuples #-}
17{-# LANGUAGE UndecidableInstances #-}
22{-# LANGUAGE UndecidableInstances #-}
18−{-# LANGUAGE PolyKinds #-}
23+module Reflex.Spider.Internal (Spider, SpiderEnv (..), Global, SpiderHost, runSpiderHost, SpiderEventHandle (..), showSubscriberType, showEventType, ComputeM (..), MergeSubscribedParent (..), HasSpiderEnv (..), newSpiderEnv, SpiderPullM (..), SpiderPushM (..), ReadPhase (..)) where
19−{-# LANGUAGE DeriveFunctor #-}
20−{-# LANGUAGE StandaloneDeriving #-}
21−{-# LANGUAGE InstanceSigs #-}
22−{-# LANGUAGE MultiWayIf #-}
24−#ifdef USE_REFLEX_OPTIMIZER
25+import Data.WeakBag (WeakBag, WeakBagTicket)
25−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
26+import qualified Data.WeakBag as WeakBag
26−#endif
27+import qualified Reflex.Class as R
27−{-# OPTIONS_GHC -Wunused-binds #-}
28+import qualified Reflex.Host.Class as R
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
32−#if MIN_VERSION_base(4,10,0)
33−import Control.Applicative (liftA2)
30+import Control.Applicative
35import Control.Concurrent
31import Control.Concurrent
36import Control.Exception
32import Control.Exception
37−import Control.Monad hiding (forM, forM_, mapM, mapM_)
33+import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
38import Control.Monad.Exception
34import Control.Monad.Exception
39−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
35+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
40−import Control.Monad.Primitive
41−import Control.Monad.Reader.Class
36+import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
42−import Control.Monad.IO.Class
43−import Control.Monad.ReaderIO
44import Control.Monad.Ref
37import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
38+import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
46−import qualified Control.Monad.Fail as MonadFail
47import Data.Align
39import Data.Align
49−import Data.Dependent.Map (DMap)
40+import Data.Dependent.Map (DMap, DSum (..))
50import qualified Data.Dependent.Map as DMap
41import qualified Data.Dependent.Map as DMap
51−import Data.Dependent.Sum (DSum (..))
42+import Data.Foldable
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
43+import Data.Function
56−import Data.Functor.Misc
44+import Data.Functor.Compose
57−import Data.Functor.Product
58import Data.GADT.Compare
45import Data.GADT.Compare
59import Data.IntMap.Strict (IntMap)
46import Data.IntMap.Strict (IntMap)
60import qualified Data.IntMap.Strict as IntMap
47import qualified Data.IntMap.Strict as IntMap
61import Data.IORef
48import Data.IORef
62−import Data.Kind (Type)
49+import Data.List
63−import Data.Maybe hiding (mapMaybe)
50+import Data.Maybe
64−import Data.Monoid (mempty, (<>))
51+import Data.Monoid ((<>))
65−import Data.Proxy
52+import Data.Some (Some)
53+import qualified Data.Some as Some
66import Data.These
54import Data.These
67import Data.Traversable
55import Data.Traversable
68−import Data.Type.Equality ((:~:)(Refl))
56+import System.Mem.Weak
69−import Data.Witherable (Filterable, mapMaybe)
57+
70−import GHC.Exts hiding (toList)
58+import GHC.Base (IO (..))
71import GHC.IORef (IORef (..))
59import GHC.IORef (IORef (..))
72import GHC.Stack
60import GHC.Stack
73−import Reflex.FastWeak
61+
62+import Control.Monad.Primitive
74import System.IO.Unsafe
64import System.IO.Unsafe
75−import System.Mem.Weak
76import Unsafe.Coerce
65import Unsafe.Coerce
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)
91import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
67import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
92import qualified Data.List.NonEmpty as NonEmpty
68import qualified Data.List.NonEmpty as NonEmpty
93import Data.Tree (Forest, Tree (..), drawForest)
69import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
97−import qualified Data.FastWeakBag as FastWeakBag
99−import Data.Reflection
100−import Data.Some (Some(Some))
101−import Data.Type.Coercion
102−import Data.Profunctor.Unsafe ((#.), (.#))
103−import Data.WeakBag (WeakBag, WeakBagTicket, _weakBag_children)
104−import qualified Data.WeakBag as WeakBag
105−import qualified Reflex.Class
106−import qualified Reflex.Class as R
107−import qualified Reflex.Host.Class
108−import Reflex.NotReady.Class
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
71+-- Note: must come last to silence warnings due to AMP on GHC < 7.10
120−debugStrLn :: String -> IO ()
72+import Prelude hiding (any, concat, mapM, mapM_, sequence)
121−debugStrLn = putStrLn
123−#ifdef DEBUG_TRACE_EVENTS
74+type SubscriberList a = WeakBag (Subscriber a)
124−withStackOneLine :: (BS8.ByteString -> a) -> a
75+type SubscriberListTicket a = WeakBagTicket (Subscriber 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"
132debugPropagate :: Bool
77debugPropagate :: Bool
@@ -136,65 +81,52 @@ debugInvalidateHeight :: Bool
136debugInvalidate :: Bool
81debugInvalidate :: Bool
138#ifdef DEBUG
83#ifdef DEBUG
139#define DEBUG_NODEIDS
85#define DEBUG_NODEIDS
141−#ifdef DEBUG_TRACE_PROPAGATION
142debugPropagate = True
87debugPropagate = True
144−debugPropagate = False
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
150debugInvalidateHeight = False
89debugInvalidateHeight = False
153−#ifdef DEBUG_TRACE_INVALIDATION
154debugInvalidate = True
91debugInvalidate = True
156−debugInvalidate = False
159class HasNodeId a where
93class HasNodeId a where
160 getNodeId :: a -> Int
94 getNodeId :: a -> Int
162−instance HasNodeId (CacheSubscribed x a) where
96+instance HasNodeId (Hold p a) where
163− getNodeId = _cacheSubscribed_nodeId
165−instance HasNodeId (FanInt x a) where
166− getNodeId = _fanInt_nodeId
168−instance HasNodeId (Hold x p) where
169 getNodeId = holdNodeId
97 getNodeId = holdNodeId
99+instance HasNodeId (PushSubscribed a b) where
100+ getNodeId = pushSubscribedNodeId
171−instance HasNodeId (SwitchSubscribed x a) where
102+instance HasNodeId (SwitchSubscribed a) where
172 getNodeId = switchSubscribedNodeId
103 getNodeId = switchSubscribedNodeId
105+instance HasNodeId (MergeSubscribed a) where
106+ getNodeId = mergeSubscribedNodeId
174−instance HasNodeId (FanSubscribed x v a) where
108+instance HasNodeId (FanSubscribed a) where
175 getNodeId = fanSubscribedNodeId
109 getNodeId = fanSubscribedNodeId
177−instance HasNodeId (CoincidenceSubscribed x a) where
111+instance HasNodeId (CoincidenceSubscribed a) where
178 getNodeId = coincidenceSubscribedNodeId
112 getNodeId = coincidenceSubscribedNodeId
180−instance HasNodeId (RootSubscribed x a) where
114+instance HasNodeId (RootSubscribed a) where
181 getNodeId = rootSubscribedNodeId
115 getNodeId = rootSubscribedNodeId
183−instance HasNodeId (Pull x a) where
117+instance HasNodeId (Pull a) where
184 getNodeId = pullNodeId
118 getNodeId = pullNodeId
186{-# INLINE showNodeId #-}
120{-# INLINE showNodeId #-}
187showNodeId :: HasNodeId a => a -> String
121showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
122+showNodeId = ("#"<>) . show . getNodeId
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
196debugPropagate = False
126debugPropagate = False
197debugInvalidateHeight = False
128debugInvalidateHeight = False
198debugInvalidate = False
130debugInvalidate = False
200-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
132-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -202,10 +134,6 @@ debugInvalidate = False
202showNodeId :: a -> String
134showNodeId :: a -> String
203showNodeId _ = ""
135showNodeId _ = ""
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
211#ifdef DEBUG_NODEIDS
139#ifdef DEBUG_NODEIDS
@@ -215,637 +143,41 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
216newNodeId :: IO Int
144newNodeId :: IO Int
217newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
145newNodeId = 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
444−eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
445−eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
447−{-# INLINE subscribeCoincidenceInner #-}
448−subscribeCoincidenceInner :: HasSpiderTimeline x => Event x a -> Height -> CoincidenceSubscribed x a -> EventM x (Maybe a, Height, EventSubscribed x)
449−subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
450− subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
451− (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
452− innerHeight <- liftIO $ getEventSubscribedHeight innerSubd
453− let height = max innerHeight outerHeight
454− defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
455− return (innerOcc, height, innerSubd)
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−--------------------------------------------------------------------------------
147+{-# NOINLINE unsafeNodeId #-}
568−-- EventSubscribed
148+unsafeNodeId :: a -> Int
569−--------------------------------------------------------------------------------
149+unsafeNodeId a = unsafePerformIO $ do
571−toAny :: a -> Any
151+ newNodeId
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
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−--------------------------------------------------------------------------------
154+--TODO: Figure out why certain things are not 'representational', then make them representational so we can use coerce
787--type role Hold representational
155--type role Hold representational
788−data Hold x p
156+data Hold p a
789− = Hold { holdValue :: !(IORef (PatchTarget p))
157+ = Hold { holdValue :: !(IORef a)
790− , holdInvalidators :: !(IORef [Weak (Invalidator x)])
158+ , holdInvalidators :: !(IORef [Weak Invalidator])
791− , holdEvent :: Event x p -- This must be lazy, or holds cannot be defined before their input Events
792− , holdParent :: !(IORef (Maybe (EventSubscription x))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
159+ , 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
793#ifdef DEBUG_NODEIDS
160#ifdef DEBUG_NODEIDS
794 , holdNodeId :: Int
161 , 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
829data EventEnv x
165data EventEnv x
166+ = EventEnv { eventEnvSpiderEnv :: !(SpiderEnv x)
830− = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
167+ , eventEnvAssignments :: !(IORef [SomeAssignment]) -- Needed for Subscribe
831− , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
168+ , eventEnvHoldInits :: !(IORef [SomeHoldInit]) -- Needed for Subscribe
832− , eventEnvDynInits :: !(IORef [SomeDynInit x])
833− , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
169+ , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate])
834− , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
170+ , eventEnvMergeInits :: !(IORef [SomeMergeInit]) -- Needed for Subscribe
835− , eventEnvClears :: !(IORef [Some Clear]) -- Needed for Subscribe
171+ , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
836− , eventEnvIntClears :: !(IORef [Some IntClear])
837− , eventEnvRootClears :: !(IORef [Some RootClear])
172+ , eventEnvRootClears :: !(IORef [SomeRootClear])
838 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
173 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
839− , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
174+ , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence]) -- Needed for Subscribe
840− , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
175+ , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge]))
843{-# INLINE runEventM #-}
178{-# INLINE runEventM #-}
844−runEventM :: EventM x a -> IO a
179+runEventM :: EventM x a -> EventEnv x -> IO a
845−runEventM = unEventM
180+runEventM = runReaderT . 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))
850class MonadIO m => Defer a m where
182class MonadIO m => Defer a m where
851 getDeferralQueue :: m (IORef [a])
183 getDeferralQueue :: m (IORef [a])
@@ -856,98 +188,90 @@ defer a = do
856 q <- getDeferralQueue
188 q <- getDeferralQueue
857 liftIO $ modifyIORef' q (a:)
189 liftIO $ modifyIORef' q (a:)
859−instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
191+instance Defer SomeAssignment (EventM x) where
860 {-# INLINE getDeferralQueue #-}
192 {-# INLINE getDeferralQueue #-}
861− getDeferralQueue = asksEventEnv eventEnvAssignments
193+ getDeferralQueue = EventM $ asks eventEnvAssignments
863−instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
195+instance Defer SomeHoldInit (EventM x) where
864 {-# INLINE getDeferralQueue #-}
196 {-# INLINE getDeferralQueue #-}
865− getDeferralQueue = asksEventEnv eventEnvHoldInits
197+ getDeferralQueue = EventM $ asks eventEnvHoldInits
867−instance HasSpiderTimeline x => Defer (SomeDynInit x) (EventM x) where
868− {-# INLINE getDeferralQueue #-}
869− getDeferralQueue = asksEventEnv eventEnvDynInits
871−instance Defer (SomeHoldInit x) (BehaviorM x) where
199+instance Defer SomeHoldInit BehaviorM where
872 {-# INLINE getDeferralQueue #-}
200 {-# INLINE getDeferralQueue #-}
873 getDeferralQueue = BehaviorM $ asks snd
201 getDeferralQueue = BehaviorM $ asks snd
875−instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
203+instance Defer SomeMergeUpdate (EventM x) where
876 {-# INLINE getDeferralQueue #-}
204 {-# INLINE getDeferralQueue #-}
877− getDeferralQueue = asksEventEnv eventEnvMergeUpdates
205+ getDeferralQueue = EventM $ asks eventEnvMergeUpdates
879−instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
207+instance Defer SomeMergeInit (EventM x) where
880 {-# INLINE getDeferralQueue #-}
208 {-# INLINE getDeferralQueue #-}
881− getDeferralQueue = asksEventEnv eventEnvMergeInits
209+ getDeferralQueue = EventM $ asks eventEnvMergeInits
883−class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
211+class HasCurrentHeight m where
884 getCurrentHeight :: m Height
212 getCurrentHeight :: m Height
885− scheduleMerge :: Height -> EventM x () -> m ()
213+ scheduleMerge :: Height -> MergeSubscribed a -> m ()
887−instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
215+instance HasCurrentHeight (EventM x) where
888 {-# INLINE getCurrentHeight #-}
216 {-# INLINE getCurrentHeight #-}
889− getCurrentHeight = do
217+ getCurrentHeight = EventM $ do
890− heightRef <- asksEventEnv eventEnvCurrentHeight
218+ heightRef <- asks eventEnvCurrentHeight
891 liftIO $ readIORef heightRef
219 liftIO $ readIORef heightRef
892 {-# INLINE scheduleMerge #-}
220 {-# INLINE scheduleMerge #-}
893− scheduleMerge height subscribed = do
221+ scheduleMerge height subscribed = EventM $ do
894− delayedRef <- asksEventEnv eventEnvDelayedMerges
222+ delayedRef <- asks eventEnvDelayedMerges
895− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
223+ liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
225+class HasSpiderEnv x m | m -> x where
226+ askSpiderEnv :: m (SpiderEnv x)
897−class HasSpiderTimeline x where
228+instance HasSpiderEnv x (EventM x) where
898− -- | Retrieve the current SpiderTimelineEnv
229+ {-# INLINE askSpiderEnv #-}
899− spiderTimeline :: SpiderTimelineEnv x
230+ askSpiderEnv = EventM $ asks eventEnvSpiderEnv
901−instance HasSpiderTimeline Global where
232+instance HasSpiderEnv x (SpiderHost x) where
902− spiderTimeline = globalSpiderTimelineEnv
233+ {-# INLINE askSpiderEnv #-}
234+ askSpiderEnv = SpiderHost ask
904−putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
236+putCurrentHeight :: Height -> EventM x ()
905−putCurrentHeight h = do
237+putCurrentHeight h = EventM $ do
906− heightRef <- asksEventEnv eventEnvCurrentHeight
238+ heightRef <- asks eventEnvCurrentHeight
907 liftIO $ writeIORef heightRef $! h
239 liftIO $ writeIORef heightRef $! h
909−instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
241+instance Defer SomeClear (EventM x) where
910 {-# INLINE getDeferralQueue #-}
242 {-# INLINE getDeferralQueue #-}
911− getDeferralQueue = asksEventEnv eventEnvClears
243+ getDeferralQueue = EventM $ asks eventEnvClears
913{-# INLINE scheduleClear #-}
245{-# INLINE scheduleClear #-}
914−scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
246+scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
915−scheduleClear r = defer $ Some $ Clear r
247+scheduleClear r = defer $ SomeClear r
917−instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
249+instance Defer SomeRootClear (EventM x) where
918 {-# INLINE getDeferralQueue #-}
250 {-# 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 #-}
927− getDeferralQueue = asksEventEnv eventEnvRootClears
251+ getDeferralQueue = EventM $ asks eventEnvRootClears
929{-# INLINE scheduleRootClear #-}
253{-# INLINE scheduleRootClear #-}
930−scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
254+scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
931−scheduleRootClear r = defer $ Some $ RootClear r
255+scheduleRootClear r = defer $ SomeRootClear r
933−instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
257+instance Defer SomeResetCoincidence (EventM x) where
934 {-# INLINE getDeferralQueue #-}
258 {-# INLINE getDeferralQueue #-}
935− getDeferralQueue = asksEventEnv eventEnvResetCoincidences
259+ getDeferralQueue = EventM $ asks eventEnvResetCoincidences
937-- Note: hold cannot examine its event until after the phase is over
261-- Note: hold cannot examine its event until after the phase is over
938−{-# INLINE [1] hold #-}
262+{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> EventM x (Hold p a) #-}
263+{-# SPECIALIZE hold :: R.Patch p => a -> Event (p a) -> ComputeM (Hold p a) #-}
939−hold :: (Patch p, Defer (SomeHoldInit x) m) => PatchTarget p -> Event x p -> m (Hold x p)
264+hold :: (R.Patch p, Defer SomeHoldInit m) => a -> Event (p a) -> m (Hold p a)
940hold v0 e = do
265hold v0 e = do
941 valRef <- liftIO $ newIORef v0
266 valRef <- liftIO $ newIORef v0
942 invsRef <- liftIO $ newIORef []
267 invsRef <- liftIO $ newIORef []
943− parentRef <- liftIO $ newIORef Nothing
268+ parentRef <- liftIO $ newIORef $ Left e
944#ifdef DEBUG_NODEIDS
269#ifdef DEBUG_NODEIDS
945 nodeId <- liftIO newNodeId
270 nodeId <- liftIO newNodeId
947 let h = Hold
272 let h = Hold
948 { holdValue = valRef
273 { holdValue = valRef
949 , holdInvalidators = invsRef
274 , holdInvalidators = invsRef
951 , holdParent = parentRef
275 , holdParent = parentRef
952#ifdef DEBUG_NODEIDS
276#ifdef DEBUG_NODEIDS
953 , holdNodeId = nodeId
277 , holdNodeId = nodeId
@@ -956,115 +280,155 @@ hold v0 e = do
956 defer $ SomeHoldInit h
280 defer $ SomeHoldInit h
284+mkWeakIORefKey :: IORef a -> b -> IO () -> IO (Weak b)
285+mkWeakIORefKey r@(IORef (STRef r#)) b (IO f) = IO $ \s ->
286+ case mkWeak# r# b f s of (# s1, w #) -> (# s1, Weak w #)
959{-# INLINE getHoldEventSubscription #-}
289{-# INLINE getHoldEventSubscription #-}
960−getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
290+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))
961getHoldEventSubscription h = do
291getHoldEventSubscription h = do
962 ep <- liftIO $ readIORef $ holdParent h
292 ep <- liftIO $ readIORef $ holdParent h
963 case ep of
293 case ep of
964− Just subd -> return subd
294+ Right subd -> return subd
965− Nothing -> do
295+ Left e -> do
967 subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
296 subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
298+ spiderEnv <- askSpiderEnv
299+ weakSubscriptionRef <- liftIO $ mkWeakIORef subscriptionRef $ return ()
300+ wh <- liftIO $ mkWeakIORefKey (holdValue h) h $ do
301+ msr <- deRefWeak weakSubscriptionRef
302+ forM_ msr $ \sr -> do
303+ subscription <- readIORef sr
304+ atomicModifyIORef (_spiderEnv_toUnsubscribe spiderEnv) $ \x -> (SomeEventSubscription subscription : x, ())
307+ -- What can we do? 1) Detect GCs at the SpiderEnv level, then go over the tree
308+ 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
968− (subscription@(EventSubscription _ _), occ) <- subscribeAndRead e =<< liftIO (newSubscriberHold h)
311+ subscription@(EventSubscription _ subd) <- subscribe e =<< liftIO (newSubscriberHold h)
969 liftIO $ writeIORef subscriptionRef $! subscription
312 liftIO $ writeIORef subscriptionRef $! subscription
313+ occ <- liftIO $ readEventSubscribed subd
970 case occ of
314 case occ of
971 Nothing -> return ()
315 Nothing -> return ()
972 Just o -> do
316 Just o -> do
973 old <- liftIO $ readIORef $ holdValue h
317 old <- liftIO $ readIORef $ holdValue h
974− case apply o old of
318+ case R.apply o old of
975 Nothing -> return ()
319 Nothing -> return ()
976 Just new -> do
320 Just new -> do
977 -- Need to evaluate these so that we don't retain the Hold itself
321 -- Need to evaluate these so that we don't retain the Hold itself
978 v <- liftIO $ evaluate $ holdValue h
322 v <- liftIO $ evaluate $ holdValue h
979 i <- liftIO $ evaluate $ holdInvalidators h
323 i <- liftIO $ evaluate $ holdInvalidators h
980 defer $ SomeAssignment v i new
324 defer $ SomeAssignment v i new
981− liftIO $ writeIORef (holdParent h) $ Just subscription
325+ liftIO $ writeIORef (holdParent h) $! Right subscription
982 return subscription
326 return subscription
984−type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
328+type BehaviorEnv = (Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]), IORef [SomeHoldInit])
330+--type role BehaviorM representational
986-- BehaviorM can sample behaviors
331-- BehaviorM can sample behaviors
987−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
332+newtype BehaviorM a = BehaviorM { unBehaviorM :: ReaderT BehaviorEnv IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
988− deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
990−instance Monad (BehaviorM x) where
334+instance Monad BehaviorM where
991 {-# INLINE (>>=) #-}
335 {-# INLINE (>>=) #-}
992 BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
336 BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
993 {-# INLINE (>>) #-}
337 {-# INLINE (>>) #-}
994 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
338 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995 {-# INLINE return #-}
339 {-# INLINE return #-}
996 return x = BehaviorM $ return x
340 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998 {-# INLINE fail #-}
341 {-# INLINE fail #-}
999 fail s = BehaviorM $ fail s
342 fail s = BehaviorM $ fail s
1002−data BehaviorSubscribed x a
344+data BehaviorSubscribed a
1003− = forall p. BehaviorSubscribedHold (Hold x p)
345+ = forall p. BehaviorSubscribedHold (Hold p a)
1004− | BehaviorSubscribedPull (PullSubscribed x a)
346+ | BehaviorSubscribedPull (PullSubscribed a)
1006−newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
348+data SomeBehaviorSubscribed = forall a. SomeBehaviorSubscribed (BehaviorSubscribed a)
1008--type role PullSubscribed representational
350--type role PullSubscribed representational
1009−data PullSubscribed x a
351+data PullSubscribed a
1010 = PullSubscribed { pullSubscribedValue :: !a
352 = PullSubscribed { pullSubscribedValue :: !a
1011− , pullSubscribedInvalidators :: !(IORef [Weak (Invalidator x)])
353+ , pullSubscribedInvalidators :: !(IORef [Weak Invalidator])
1012− , pullSubscribedOwnInvalidator :: !(Invalidator x)
354+ , pullSubscribedOwnInvalidator :: !Invalidator
1013− , pullSubscribedParents :: ![SomeBehaviorSubscribed x] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
355+ , pullSubscribedParents :: ![SomeBehaviorSubscribed] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
1016--type role Pull representational
358--type role Pull representational
1017−data Pull x a
359+data Pull a
1018− = Pull { pullValue :: !(IORef (Maybe (PullSubscribed x a)))
360+ = Pull { pullValue :: !(IORef (Maybe (PullSubscribed a)))
1019− , pullCompute :: !(BehaviorM x a)
361+ , pullCompute :: !(BehaviorM a)
1020#ifdef DEBUG_NODEIDS
362#ifdef DEBUG_NODEIDS
1021 , pullNodeId :: Int
363 , pullNodeId :: Int
1025−data Invalidator x
367+data Invalidator
1026− = forall a. InvalidatorPull (Pull x a)
368+ = forall a. InvalidatorPull (Pull a)
1027− | forall a. InvalidatorSwitch (SwitchSubscribed x a)
369+ | forall a. InvalidatorSwitch (SwitchSubscribed a)
1029−data RootSubscribed x a = forall k. GCompare k => RootSubscribed
371+data RootSubscribed a = forall k. GCompare k => RootSubscribed
1030 { rootSubscribedKey :: !(k a)
372 { rootSubscribedKey :: !(k a)
1031− , rootSubscribedCachedSubscribed :: !(IORef (DMap k (RootSubscribed x))) -- From the original Root
373+ , rootSubscribedCachedSubscribed :: !(IORef (DMap k RootSubscribed)) -- From the original Root
1032− , rootSubscribedSubscribers :: !(WeakBag (Subscriber x a))
374+ , rootSubscribedSubscribers :: !(SubscriberList a)
1033 , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
375 , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
1034 , rootSubscribedUninit :: IO ()
376 , rootSubscribedUninit :: IO ()
1035− , rootSubscribedWeakSelf :: !(IORef (Weak (RootSubscribed x a))) --TODO: Can we make this a lazy non-IORef and then force it manually to avoid an indirection each time we use it?
377+ , 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?
1036#ifdef DEBUG_NODEIDS
378#ifdef DEBUG_NODEIDS
1037 , rootSubscribedNodeId :: Int
379 , rootSubscribedNodeId :: Int
1041−data Root x k
383+data Root (k :: * -> *)
1042 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
384 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
1043− , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
385+ , rootSubscribed :: !(IORef (DMap k RootSubscribed))
1044− , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
386+ , rootInit :: !(forall a. k a -> RootTrigger a -> IO (IO ()))
1047−data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
389+data SomeHoldInit = forall p a. R.Patch p => SomeHoldInit !(Hold p a)
1049−data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
391+data SomeMergeUpdate = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap (DMap k Event)) (MergeSubscribed k)
1051−data SomeMergeUpdate x = SomeMergeUpdate
393+data SomeMergeInit = forall k. GCompare k => SomeMergeInit !(MergeSubscribed k) !(Event (R.PatchDMap (DMap k Event)))
1052− { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
1053− , _someMergeUpdate_invalidateHeight :: !(IO ())
1054− , _someMergeUpdate_recalculateHeight :: !(IO ())
1057−newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
395+data SomeEventSubscription = forall a. SomeEventSubscription (EventSubscription a)
1059-- EventM can do everything BehaviorM can, plus create holds
397-- EventM can do everything BehaviorM can, plus create holds
1060−newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
398+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
400+data PushSubscribed a b
401+ = PushSubscribed { pushSubscribedCachedSubscribed :: !(IORef (Maybe (PushSubscribed a b)))
402+ , 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)
403+ , pushSubscribedHeight :: !(IORef Height)
404+ , pushSubscribedSubscribers :: !(SubscriberList b)
405+ , pushSubscribedSelf :: !(Subscriber a) -- Hold this in memory to ensure our WeakReferences don't die --TODO: Probably unneeded now
406+ , pushSubscribedWeakSelf :: !(IORef (Weak (PushSubscribed a b)))
407+ , pushSubscribedParent :: !(EventSubscription a)
409+ , pushSubscribedNodeId :: Int
1062−newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
413+newtype ComputeM a = ComputeM { unComputeM :: ReaderT (IORef [SomeHoldInit]) IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1064−data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
415+instance Defer SomeHoldInit ComputeM where
1065− { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
416+ getDeferralQueue = ComputeM ask
1066− , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
417+
418+{-# SPECIALIZE runComputeM :: ComputeM a -> EventM x a #-}
419+runComputeM :: Defer SomeHoldInit m => ComputeM a -> m a
420+runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
423+ = 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?)
424+ , pushParent :: !(Event a)
425+ , pushSubscribed :: !(IORef (Maybe (PushSubscribed a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
428+data MergeSubscribedParent k a
429+ = MergeSubscribedParent { mergeSubscribedParentSubscription :: !(EventSubscription a)
430+ , mergeSubscribedParentSubscriber :: !(Subscriber a)
1069data HeightBag = HeightBag
433data HeightBag = HeightBag
1070 { _heightBag_size :: {-# UNPACK #-} !Int
434 { _heightBag_size :: {-# UNPACK #-} !Int
@@ -1082,8 +446,7 @@ heightBagFromList :: [Height] -> HeightBag
1082heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
446heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
1084heightBagAdd :: Height -> HeightBag -> HeightBag
448heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
449+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1088heightBagRemove :: Height -> HeightBag -> HeightBag
451heightBagRemove :: Height -> HeightBag -> HeightBag
1089heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
452heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +455,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
1092 0 -> IntMap.delete h c
455 0 -> IntMap.delete h c
1093 _ -> IntMap.insert h (pred old) c
456 _ -> 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
1102heightBagMax :: HeightBag -> Height
458heightBagMax :: HeightBag -> Height
1103heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
459heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
1104 Just ((h, _), _) -> Height h
460 Just ((h, _), _) -> Height h
@@ -1116,183 +472,363 @@ heightBagVerify b@(HeightBag s c) = if
1116heightBagVerify = id
472heightBagVerify = id
475+data MergeSubscribed k
476+ = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed k))) -- From the original merge
477+ , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
478+ , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
479+ , mergeSubscribedHeight :: !(IORef Height)
480+ , mergeSubscribedHeightBag :: !(IORef HeightBag)
481+ , mergeSubscribedSubscribers :: !(SubscriberList (DMap k Identity))
482+ , mergeSubscribedChange :: !(IORef (Subscriber (R.PatchDMap (DMap k Event)), EventSubscribed (R.PatchDMap (DMap k Event))))
483+ , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent k)))
484+ , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed k)))
486+ , mergeSubscribedNodeId :: Int
490+--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
492+ = Merge { mergeParents :: !(Dynamic R.PatchDMap (DMap k Event))
493+ , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed k)))
1119−data FanSubscribedChildren x k v a = FanSubscribedChildren
496+data FanSubscribedChildren k a = FanSubscribedChildren
1120− { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x (v a)))
497+ { _fanSubscribedChildren_list :: !(SubscriberList a)
1121− , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k v)
498+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed k)
1122− , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k v)))
499+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed k)))
1125−data FanSubscribed x k v
502+data FanSubscribed k
1126− = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
503+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed k)))
1127− , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k v)))
1128− , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k v))) -- This DMap should never be empty
504+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren k))) -- This DMap should never be empty
1129− , fanSubscribedParent :: !(EventSubscription x)
505+ , fanSubscribedParent :: !(EventSubscription (DMap k Identity))
1130#ifdef DEBUG_NODEIDS
506#ifdef DEBUG_NODEIDS
1131 , fanSubscribedNodeId :: Int
507 , fanSubscribedNodeId :: Int
1135−data Fan x k v
511+data Fan k
1136− = Fan { fanParent :: !(Event x (DMap k v))
512+ = Fan { fanParent :: !(Event (DMap k Identity))
1137− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
513+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed k)))
1140−data SwitchSubscribed x a
516+data SwitchSubscribed a
1141− = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
517+ = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1142 , switchSubscribedOccurrence :: !(IORef (Maybe a))
518 , switchSubscribedOccurrence :: !(IORef (Maybe a))
1143 , switchSubscribedHeight :: !(IORef Height)
519 , switchSubscribedHeight :: !(IORef Height)
1144− , switchSubscribedSubscribers :: !(WeakBag (Subscriber x a))
520+ , switchSubscribedSubscribers :: !(SubscriberList a)
1145− , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !(Invalidator x)
521+ , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !Invalidator
1146− , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak (Invalidator x)))
522+ , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak Invalidator))
1147− , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed x])
523+ , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed])
1148− , switchSubscribedParent :: !(Behavior x (Event x a))
524+ , switchSubscribedParent :: !(Behavior (Event a))
1149− , switchSubscribedCurrentParent :: !(IORef (EventSubscription x))
525+ , switchSubscribedCurrentParent :: !(IORef (EventSubscription a))
1150− , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed x a)))
526+ , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed a)))
1151#ifdef DEBUG_NODEIDS
527#ifdef DEBUG_NODEIDS
1152 , switchSubscribedNodeId :: Int
528 , switchSubscribedNodeId :: Int
1156−data Switch x a
532+data Switch a
1157− = Switch { switchParent :: !(Behavior x (Event x a))
533+ = Switch { switchParent :: !(Behavior (Event a))
1158− , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
534+ , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed a)))
1161−#ifdef USE_TEMPLATE_HASKELL
1162−{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1164−data CoincidenceSubscribed x a
537+data CoincidenceSubscribed a
1165− = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
538+ = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1166 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
539 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
1167− , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
540+ , coincidenceSubscribedSubscribers :: !(SubscriberList a)
1168 , coincidenceSubscribedHeight :: !(IORef Height)
541 , coincidenceSubscribedHeight :: !(IORef Height)
1169− , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber x (Event x a))
542+ , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber (Event a))
1170− , coincidenceSubscribedOuterParent :: !(EventSubscription x)
543+ , coincidenceSubscribedOuterParent :: !(EventSubscription (Event a))
1171− , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x)))
544+ , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed a)))
1172− , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed x a)))
545+ , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed a)))
1173#ifdef DEBUG_NODEIDS
546#ifdef DEBUG_NODEIDS
1174 , coincidenceSubscribedNodeId :: Int
547 , coincidenceSubscribedNodeId :: Int
1178−data Coincidence x a
551+data Coincidence a
1179− = Coincidence { coincidenceParent :: !(Event x (Event x a))
552+ = Coincidence { coincidenceParent :: !(Event (Event a))
1180− , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
553+ , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed a)))
1183−{-# NOINLINE newInvalidatorSwitch #-}
556+data Subscriber a
1184−newInvalidatorSwitch :: SwitchSubscribed x a -> IO (Invalidator x)
557+ = forall b. SubscriberPush (a -> ComputeM (Maybe b)) (PushSubscribed a b) --TODO: Why does this have the pushCompute in it?
1185−newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
558+ | forall k. GCompare k => SubscriberMerge !(k a) (MergeSubscribed k) --TODO: Can we inline the GCompare?
559+ | forall k. (a ~ R.PatchDMap (DMap k Event), GCompare k) => SubscriberMergeChange (MergeSubscribed k)
560+ | forall k. (GCompare k, a ~ DMap k Identity) => SubscriberFan (FanSubscribed k)
561+ | forall p b. (a ~ p b, R.Patch p) => SubscriberHold !(Hold p b)
562+ | forall b. (a ~ Identity b) => SubscriberHoldIdentity !(Hold Identity b)
563+ | SubscriberSwitch (SwitchSubscribed a)
564+ | forall b. a ~ Event b => SubscriberCoincidenceOuter (CoincidenceSubscribed b)
565+ | SubscriberCoincidenceInner (CoincidenceSubscribed a)
568+showSubscriberType :: Subscriber a -> String
569+showSubscriberType = \case
570+ SubscriberPush _ _ -> "SubscriberPush"
571+ SubscriberMerge _ _ -> "SubscriberMerge"
572+ SubscriberFan _ -> "SubscriberFan"
573+ SubscriberMergeChange _ -> "SubscriberMergeChange"
574+ SubscriberHold _ -> "SubscriberHold"
575+ SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
576+ SubscriberSwitch _ -> "SubscriberSwitch"
577+ SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
578+ SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
579+ SubscriberHandle -> "SubscriberHandle"
582+ = forall k. GCompare k => EventRoot !(k a) !(Root k)
584+ | forall b. EventPush !(Push b a)
585+ | forall k. (GCompare k, a ~ DMap k Identity) => EventMerge !(Merge k)
586+ | forall k. GCompare k => EventFan !(k a) !(Fan k)
587+ | EventSwitch !(Switch a)
588+ | EventCoincidence !(Coincidence a)
589+ | forall p b. (a ~ p b, R.Patch p) => EventHold !(Hold p b)
590+ | forall p b. (a ~ p b, R.Patch p) => EventDyn !(Dyn p b)
591+ | forall b. (a ~ Identity b) => EventHoldIdentity !(Hold Identity b)
592+ | forall b. (a ~ Identity b) => EventDynIdentity !(Dyn Identity b)
594+showEventType :: Event a -> String
595+showEventType = \case
596+ EventRoot _ _ -> "EventRoot"
597+ EventNever -> "EventNever"
598+ EventPush _ -> "EventPush"
599+ EventMerge _ -> "EventMerge"
600+ EventFan _ _ -> "EventFan"
601+ EventSwitch _ -> "EventSwitch"
602+ EventCoincidence _ -> "EventCoincidence"
603+ EventHold _ -> "EventHold"
604+ EventDyn _ -> "EventDyn"
605+ EventHoldIdentity _ -> "EventHoldIdentity"
606+ EventDynIdentity _ -> "EventDynIdentity"
608+data EventSubscription a = EventSubscription
609+ { _eventSubscription_ticket :: !(Maybe (SubscriberListTicket a))
610+ , _eventSubscription_subscribed :: !(EventSubscribed a)
1187−{-# NOINLINE newInvalidatorPull #-}
613+data EventSubscribed a
1188−newInvalidatorPull :: Pull x a -> IO (Invalidator x)
614+ = EventSubscribedRoot {-# NOUNPACK #-} (RootSubscribed a)
1189−newInvalidatorPull p = return $! InvalidatorPull p
615+ | EventSubscribedNever
616+ | forall b. EventSubscribedPush !(PushSubscribed b a)
617+ | forall k. (GCompare k, a ~ DMap k Identity) => EventSubscribedMerge !(MergeSubscribed k)
618+ | forall k. GCompare k => EventSubscribedFan !(k a) !(FanSubscribed k)
619+ | EventSubscribedSwitch !(SwitchSubscribed a)
620+ | EventSubscribedCoincidence !(CoincidenceSubscribed a)
622+unsubscribe :: EventSubscription a -> IO ()
623+unsubscribe (EventSubscription msln _) = forM_ msln $ \sln -> WeakBag.remove sln
625+-- These function are constructor functions that are marked NOINLINE so they are
626+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
627+-- so any weak references that are attached to the constructors will have their
628+-- finalizer run. Using the opaque constructor, does not see the
629+-- constructor application, so it behaves like an IORef and cannot be fused away.
631+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
632+-- the weak pointer to it in some cases.
1191−instance HasSpiderTimeline x => Filterable (Event x) where
634+--TODO: I think all of these noinlines are now unnecessary
1192− mapMaybe f = push $ return . f
635+{-# NOINLINE newSubscriberPush #-}
636+newSubscriberPush :: (a -> ComputeM (Maybe b)) -> PushSubscribed a b -> IO (Subscriber a)
637+newSubscriberPush compute subd = return $! SubscriberPush compute subd
1194−instance HasSpiderTimeline x => Align (Event x) where
639+{-# RULES
1195− nil = eventNever
640+ "newSubscriberHold/Identity" forall h. newSubscriberHold h = newSubscriberHoldIdentity h
1196−#if MIN_VERSION_these(0, 8, 0)
641+ #-}
1197−instance HasSpiderTimeline x => Semialign (Event x) where
642+{-# NOINLINE newSubscriberHold #-}
1198−#endif
643+newSubscriberHold :: R.Patch p => Hold p a -> IO (Subscriber (p a))
1199− align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
644+newSubscriberHold h = return $! SubscriberHold h
1200− DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
1202−#ifdef MIN_VERSION_semialign
646+{-# NOINLINE newSubscriberHoldIdentity #-}
1203−#if MIN_VERSION_semialign(1,1,0)
647+newSubscriberHoldIdentity :: Hold Identity a -> IO (Subscriber (Identity a))
1204−instance HasSpiderTimeline x => Zip (Event x) where
648+newSubscriberHoldIdentity h = return $! SubscriberHoldIdentity h
1206− zip x y = mapMaybe justThese $ align x y
650+{-# NOINLINE newSubscriberMerge #-}
1207−#endif
651+newSubscriberMerge :: GCompare k => k a -> MergeSubscribed k -> IO (Subscriber a)
652+newSubscriberMerge k subd = return $! SubscriberMerge k subd
654+{-# NOINLINE newSubscriberMergeChange #-}
655+newSubscriberMergeChange :: GCompare k => MergeSubscribed k -> IO (Subscriber (R.PatchDMap (DMap k Event)))
656+newSubscriberMergeChange subd = return $! SubscriberMergeChange subd
1209−data DynType x p = UnsafeDyn !(BehaviorM x (PatchTarget p), Event x p)
658+{-# NOINLINE newSubscriberFan #-}
1210− | BuildDyn !(EventM x (PatchTarget p), Event x p)
659+newSubscriberFan :: GCompare k => FanSubscribed k -> IO (Subscriber (DMap k Identity))
1211− | HoldDyn !(Hold x p)
660+newSubscriberFan subd = return $! SubscriberFan subd
1213−newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
662+{-# NOINLINE newSubscriberSwitch #-}
663+newSubscriberSwitch :: SwitchSubscribed a -> IO (Subscriber a)
664+newSubscriberSwitch subd = return $! SubscriberSwitch subd
1215−newMapDyn :: HasSpiderTimeline x => (a -> b) -> DynamicS x (Identity a) -> DynamicS x (Identity b)
666+{-# NOINLINE newSubscriberCoincidenceOuter #-}
667+newSubscriberCoincidenceOuter :: CoincidenceSubscribed b -> IO (Subscriber (Event b))
668+newSubscriberCoincidenceOuter subd = return $! SubscriberCoincidenceOuter subd
670+{-# NOINLINE newSubscriberCoincidenceInner #-}
671+newSubscriberCoincidenceInner :: CoincidenceSubscribed a -> IO (Subscriber a)
672+newSubscriberCoincidenceInner subd = return $! SubscriberCoincidenceInner subd
674+{-# NOINLINE newInvalidatorSwitch #-}
675+newInvalidatorSwitch :: SwitchSubscribed a -> IO Invalidator
676+newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
678+{-# NOINLINE newInvalidatorPull #-}
679+newInvalidatorPull :: Pull a -> IO Invalidator
680+newInvalidatorPull p = return $! InvalidatorPull p
683+ = DynamicHold !(Hold p a)
684+ | p ~ Identity => DynamicHoldIdentity !(Hold Identity a)
686+ | DynamicDyn !(Dyn p a)
687+ | p ~ Identity => DynamicDynIdentity !(Dyn Identity a)
689+{-# INLINE current #-}
690+current :: R.Patch p => Dynamic p a -> Behavior a
692+ DynamicHold h -> BehaviorHold h
693+ DynamicHoldIdentity h -> BehaviorHoldIdentity h
694+ DynamicConst a -> BehaviorConst a
695+ DynamicDyn d -> BehaviorDyn d
696+ DynamicDynIdentity d -> BehaviorDynIdentity d
698+--TODO: If you only need updated, not current, can we avoid actually constructing the Hold?
699+{-# INLINE updated #-}
700+updated :: R.Patch p => Dynamic p a -> Event (p a)
702+ DynamicHold h -> EventHold h
703+ DynamicHoldIdentity h -> EventHoldIdentity h
704+ DynamicConst _ -> EventNever
705+ DynamicDyn d -> EventDyn d
706+ DynamicDynIdentity d -> EventDynIdentity d
708+newMapDyn :: (a -> b) -> Dynamic Identity a -> Dynamic Identity b
1216−newMapDyn f d = dynamicDynIdentity $ unsafeBuildDynamic (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
709+newMapDyn f d = DynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ current d) (fmap (Identity . f . runIdentity) $ updated d)
711+instance Functor (Dynamic Identity) where
712+ fmap f d = newMapDyn f d
714+instance Applicative (Dynamic Identity) where
716+ (<*>) = zipDynWith ($)
720+instance R.FunctorMaybe Event where
721+ fmapMaybe f = push $ return . f
723+instance Align Event where
725+ align ea eb = R.fmapMaybe R.dmapToThese $ merge $ DynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
1218--TODO: Avoid the duplication between this and R.zipDynWith
727--TODO: Avoid the duplication between this and R.zipDynWith
1219−zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> DynamicS x (Identity a) -> DynamicS x (Identity b) -> DynamicS x (Identity c)
728+zipDynWith :: (a -> b -> c) -> Dynamic Identity a -> Dynamic Identity b -> Dynamic Identity c
1220zipDynWith f da db =
729zipDynWith f da db =
1221− let eab = align (dynamicUpdated da) (dynamicUpdated db)
730+ let eab = align (updated da) (updated db)
1222 ec = flip push eab $ \o -> do
731 ec = flip push eab $ \o -> do
1223 (a, b) <- case o of
732 (a, b) <- case o of
1224 This (Identity a) -> do
733 This (Identity a) -> do
1225− b <- readBehaviorUntracked $ dynamicCurrent db
734+ b <- readBehaviorUntracked $ current db
1226 return (a, b)
735 return (a, b)
1227 That (Identity b) -> do
736 That (Identity b) -> do
1228− a <- readBehaviorUntracked $ dynamicCurrent da
737+ a <- readBehaviorUntracked $ current da
1229 return (a, b)
738 return (a, b)
1230 These (Identity a) (Identity b) -> return (a, b)
739 These (Identity a) (Identity b) -> return (a, b)
1231 return $ Just $ Identity $ f a b
740 return $ Just $ Identity $ f a b
1232− in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
741+ in DynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (current da) <*> readBehaviorUntracked (current db)) ec
743+instance Monad (Dynamic Identity) where
744+ {-# INLINE return #-}
746+ {-# INLINE (>>=) #-}
747+ x >>= f = DynamicDynIdentity $ newJoinDyn $ newMapDyn f x --TODO: (>>), fail
751+ fail _ = error "Dynamic does not support 'fail'"
1234−buildDynamic :: (Defer (SomeDynInit x) m, Patch p) => EventM x (PatchTarget p) -> Event x p -> m (Dyn x p)
753+newtype Dyn p a = Dyn { unDyn :: IORef (Either (BehaviorM a, Event (p a)) (Hold p a)) }
1235−buildDynamic readV0 v' = do
1236− result <- liftIO $ newIORef $ BuildDyn (readV0, v')
1237− let !d = Dyn result
1238− defer $ SomeDynInit d
1241−unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
755+unsafeDyn :: BehaviorM a -> Event (p a) -> Dyn p a
1242−unsafeBuildDynamic readV0 v' =
756+unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
1243− Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
757+ where x = (readV0, v')
759+newJoinDyn :: Dynamic Identity (Dynamic Identity a) -> Dyn Identity a
761+ let readV0 = readBehaviorTracked . current =<< readBehaviorTracked (current d)
762+ eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . current . runIdentity) $ updated d
763+ eInner = switch $ fmap updated $ current d
764+ eBoth = coincidence $ fmap (updated . runIdentity) $ updated d
765+ v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
766+ in unsafeDyn readV0 v'
768+--type role Behavior representational
770+ = forall p. BehaviorHold !(Hold p a)
771+ | BehaviorHoldIdentity !(Hold Identity a)
773+ | BehaviorPull !(Pull a)
774+ | BehaviorDynIdentity !(Dyn Identity a)
775+ | forall p. R.Patch p => BehaviorDyn !(Dyn p a)
1245-- ResultM can read behaviors and events
777-- ResultM can read behaviors and events
1246type ResultM = EventM
778type ResultM = EventM
780+{-# NOINLINE unsafeNewIORef #-}
781+unsafeNewIORef :: a -> b -> IORef b
782+unsafeNewIORef _ b = unsafePerformIO $ newIORef b
1248−instance HasSpiderTimeline x => Functor (Event x) where
784+instance Functor Event where
1249 fmap f = push $ return . Just . f
785 fmap f = push $ return . Just . f
1251−instance Functor (Behavior x) where
787+instance Functor Behavior where
1252− fmap f = pull . fmap f . readBehaviorTracked
788+ fmap f = pull . liftM f . readBehaviorTracked
1254−{-# INLINE push #-}
790+{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
1255−push :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
791+push :: forall a b. (a -> ComputeM (Maybe b)) -> Event a -> Event b
1256−push f e = cacheEvent (pushCheap f e)
792+push f e = EventPush $ Push
795+ , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
797+-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
1258−{-# INLINABLE pull #-}
799+{-# NOINLINE pull #-}
1259−pull :: BehaviorM x a -> Behavior x a
800+pull :: BehaviorM a -> Behavior a
1260−pull a = unsafePerformIO $ do
801+pull a = BehaviorPull $ Pull
1261− ref <- newIORef Nothing
802+ { pullCompute = a
803+ , pullValue = unsafeNewIORef a Nothing
1262#ifdef DEBUG_NODEIDS
804#ifdef DEBUG_NODEIDS
1263− nid <- newNodeId
805+ , pullNodeId = unsafeNodeId a
1265− pure $ behaviorPull $ Pull
1268−#ifdef DEBUG_NODEIDS
1273−{-# INLINABLE switch #-}
809+{-# NOINLINE switch #-}
1274−switch :: HasSpiderTimeline x => Behavior x (Event x a) -> Event x a
810+switch :: Behavior (Event a) -> Event a
1275−switch a = unsafePerformIO $ do
811+switch a = EventSwitch $ Switch
1276− ref <- newIORef Nothing
1277− pure $ eventSwitch $ Switch
1278− { switchParent = a
812+ { switchParent = a
1279− , switchSubscribed = ref
813+ , switchSubscribed = unsafeNewIORef a Nothing
1282−coincidence :: HasSpiderTimeline x => Event x (Event x a) -> Event x a
816+coincidence :: Event (Event a) -> Event a
1283−coincidence a = unsafePerformIO $ do
817+coincidence a = EventCoincidence $ Coincidence
1284− ref <- newIORef Nothing
1285− pure $ eventCoincidence $ Coincidence
1286− { coincidenceParent = a
818+ { coincidenceParent = a
1287− , coincidenceSubscribed = ref
819+ , coincidenceSubscribed = unsafeNewIORef a Nothing
822+propagateAndUpdateSubscribersRef :: SubscriberList a -> a -> EventM x ()
823+propagateAndUpdateSubscribersRef subscribersRef a = do
824+ propagate a subscribersRef
1290-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
826-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
1291−run :: forall x b. HasSpiderTimeline x => [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
827+run :: [DSum RootTrigger Identity] -> ResultM x b -> SpiderHost x b
1292run roots after = do
828run roots after = do
1293− tracePropagate (Proxy :: Proxy x) $ "Running an event frame with " <> show (length roots) <> " events"
829+ tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
1294− let t = spiderTimeline :: SpiderTimelineEnv x
830+ spiderEnv <- SpiderHost ask
1295− result <- SpiderHost $ withMVar (_spiderTimeline_lock (unSTE t)) $ \_ -> unSpiderHost $ runFrame $ do
831+ result <- SpiderHost $ lift $ withMVar (_spiderEnv_lock spiderEnv) $ \_ -> flip runReaderT spiderEnv $ unSpiderHost $ runFrame $ do
1296 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
832 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
1297 occBefore <- liftIO $ do
833 occBefore <- liftIO $ do
1298 occBefore <- readIORef occRef
834 occBefore <- readIORef occRef
@@ -1303,40 +839,43 @@ run roots after = do
1303 return $ Just r
839 return $ Just r
1304 else return Nothing
840 else return Nothing
1305 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
841 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
1306− propagate a subscribersRef
842+ propagateAndUpdateSubscribersRef subscribersRef a
1307− delayedRef <- asksEventEnv eventEnvDelayedMerges
843+ delayedRef <- EventM $ asks eventEnvDelayedMerges
1308 let go = do
844 let go = do
1309 delayed <- liftIO $ readIORef delayedRef
845 delayed <- liftIO $ readIORef delayedRef
1310 case IntMap.minViewWithKey delayed of
846 case IntMap.minViewWithKey delayed of
1311 Nothing -> return ()
847 Nothing -> return ()
1312 Just ((currentHeight, cur), future) -> do
848 Just ((currentHeight, cur), future) -> do
1313− tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
849+ tracePropagate $ "Running height " ++ show currentHeight
1314 putCurrentHeight $ Height currentHeight
850 putCurrentHeight $ Height currentHeight
1315 liftIO $ writeIORef delayedRef $! future
851 liftIO $ writeIORef delayedRef $! future
1316− sequence_ cur
852+ forM_ cur $ \d -> case d of
853+ DelayedMerge subscribed -> do
854+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
855+ case height `compare` Height currentHeight of
856+ LT -> error "Somehow a merge's height has been decreased after it was scheduled"
857+ GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
859+ m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
860+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! DMap.empty
861+ --TODO: Assert that m is not empty
862+ liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $! Just m
863+ scheduleClear $ mergeSubscribedOccurrence subscribed
864+ propagateAndUpdateSubscribersRef (mergeSubscribedSubscribers subscribed) m
1319 putCurrentHeight maxBound
867 putCurrentHeight maxBound
1321− tracePropagate (Proxy :: Proxy x) "Done running an event frame"
869+ tracePropagate "Done running an event frame"
1322 return result
870 return result
1324−scheduleMerge' :: HasSpiderTimeline x => Height -> IORef Height -> EventM x () -> EventM x ()
872+data SomeClear = forall a. SomeClear (IORef (Maybe a))
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?)
1333−newtype Clear a = Clear (IORef (Maybe a))
874+data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1335−newtype IntClear a = IntClear (IORef (IntMap a))
876+data SomeAssignment = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak Invalidator]) a
1337−newtype RootClear k = RootClear (IORef (DMap k Identity))
878+data DelayedMerge = forall k. DelayedMerge (MergeSubscribed k)
1339−data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
1341debugFinalize :: Bool
880debugFinalize :: Bool
1342debugFinalize = False
881debugFinalize = False
@@ -1346,110 +885,79 @@ mkWeakPtrWithDebug x debugNote = do
1346 x' <- evaluate x
885 x' <- evaluate x
1347 mkWeakPtr x' $
886 mkWeakPtr x' $
1348 if debugFinalize
887 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
888+ then Just $ putStrLn $ "finalizing: " ++ debugNote
1350 else Nothing
889 else Nothing
1352type WeakList a = [Weak a]
891type WeakList a = [Weak a]
1354−type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
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"
1381{-# INLINE withIncreasedDepth #-}
893{-# INLINE withIncreasedDepth #-}
1382−withIncreasedDepth :: forall proxy x m a. CanTrace x m => proxy x -> m a -> m a
895+withIncreasedDepth :: CanTrace x m => m a -> m a
1383−withIncreasedDepth _ a = do
896+withIncreasedDepth a = do
1384− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) succ
897+ spiderEnv <- askSpiderEnv
898+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) succ
1385 result <- a
899 result <- a
1386− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
900+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) pred
1387 return result
901 return result
1389−{-# INLINE tracePropagate #-}
1390−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1391−tracePropagate p = when debugPropagate . trace p
1393−{-# INLINE traceInvalidate #-}
1394−traceInvalidate :: String -> IO ()
1395−traceInvalidate = when debugInvalidate . liftIO . debugStrLn
1397−{-# INLINE traceInvalidateHeight #-}
1398−traceInvalidateHeight :: String -> IO ()
1399−traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
1401−{-# INLINE trace #-}
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 ()
1407−traceM _ getMessage = do
1408− message <- getMessage
1409− d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1410− liftIO $ debugStrLn $ replicate d ' ' <> message
903+withIncreasedDepth :: m a -> m a
904+withIncreasedDepth = id
1414−{-# INLINE withIncreasedDepth #-}
907+type CanTrace x m = (HasSpiderEnv x m, MonadIO m)
1415−withIncreasedDepth :: proxy x -> m a -> m a
1416−withIncreasedDepth _ = id
1418{-# INLINE tracePropagate #-}
909{-# INLINE tracePropagate #-}
1419−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
910+tracePropagate :: (CanTrace x m) => String -> m ()
1420−tracePropagate _ _ = return ()
911+tracePropagate = traceWhen debugPropagate
913+{-# INLINE traceSubscribe #-}
914+traceSubscribe :: String -> IO ()
915+traceSubscribe = when debugSubscribe . liftIO . putStrLn
1422{-# INLINE traceInvalidate #-}
917{-# INLINE traceInvalidate #-}
1423traceInvalidate :: String -> IO ()
918traceInvalidate :: String -> IO ()
1424−traceInvalidate _ = return ()
919+traceInvalidate = when debugInvalidate . liftIO . putStrLn
1426−{-# INLINE traceInvalidateHeight #-}
1427−traceInvalidateHeight :: String -> IO ()
1428−traceInvalidateHeight _ = return ()
1430−{-# INLINE debugSubscriber #-}
921+{-# INLINE traceWhen #-}
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 ()
922+traceWhen :: (CanTrace x m) => Bool -> String -> m ()
1442−trace _ _ = return ()
923+traceWhen b message = traceMWhen b $ return message
1444−{-# INLINE traceM #-}
1445−traceM :: (CanTrace x m) => proxy x -> m String -> m ()
1446−traceM _ _ = return ()
925+{-# INLINE traceMWhen #-}
926+traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
927+traceMWhen b getMessage = when b $ do
928+ message <- getMessage
930+ spiderEnv <- askSpiderEnv
931+ d <- liftIO $ readIORef $ _spiderEnv_depth spiderEnv
935+ liftIO $ putStrLn $ replicate d ' ' <> message
1450whoCreatedIORef :: IORef a -> IO [String]
937whoCreatedIORef :: IORef a -> IO [String]
1451whoCreatedIORef (IORef a) = whoCreated $! a
938whoCreatedIORef (IORef a) = whoCreated $! a
940+whoCreatedEventSubscribed :: EventSubscribed a -> IO [String]
941+whoCreatedEventSubscribed = \case
942+ EventSubscribedRoot _ -> return ["root"]
943+ EventSubscribedNever -> return ["never"]
944+ EventSubscribedPush subscribed -> whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
945+ EventSubscribedFan _ subscribed -> whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
946+ EventSubscribedMerge subscribed -> whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
947+ EventSubscribedSwitch subscribed -> whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
948+ EventSubscribedCoincidence subscribed -> whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
950+walkInvalidHeightParents :: EventSubscribed a -> IO [Some EventSubscribed]
951+walkInvalidHeightParents s0 = do
952+ subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
953+ h <- liftIO $ readIORef $ eventSubscribedHeightRef s
954+ when (h == invalidHeight) $ do
955+ when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
956+ modify (Some.This s :)
957+ mapM_ loop =<< liftIO (eventSubscribedGetParents s)
958+ forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
1453groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
961groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
1454groupByHead = \case
962groupByHead = \case
1455 [] -> []
963 [] -> []
@@ -1460,288 +968,562 @@ groupByHead = \case
1460 | otherwise -> (x, xs :| []) : l
968 | otherwise -> (x, xs :| []) : l
1462listsToForest :: Eq a => [[a]] -> Forest a
970listsToForest :: Eq a => [[a]] -> Forest a
1463−listsToForest lists = buildForest <$> groupByHead (mapMaybe nonEmpty lists)
971+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1464− where buildForest (a, lists') = Node a $ listsToForest $ toList lists'
1466−showStacks :: [[String]] -> String
1467−showStacks = drawForest . listsToForest . fmap (filterStack "Reflex.Spider.Internal")
1469−filterStack :: String -> [String] -> [String]
1470−#ifdef DEBUG_HIDE_INTERNALS
1471−filterStack prefix = filter (not . (prefix `isPrefixOf`))
1473−filterStack prefix = id
1478−data EventLoopException = EventLoopException [[String]]
1479−instance Exception EventLoopException
1481−instance Show EventLoopException where
1482− show (EventLoopException stacks) = "causality loop detected:\n" <> if null stacks
1483− then "no location information, compile with profiling enabled for stack tree"
1484− else showStacks stacks
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"
973+-- | Propagate everything at the current height
974+propagate :: a -> SubscriberList a -> EventM x ()
975+propagate a subscribers = withIncreasedDepth $ do
976+ -- 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
977+ --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
978+ WeakBag.traverse subscribers $ \s -> case s of
979+ SubscriberPush compute subscribed -> {-# SCC "traversePush" #-} do
980+ tracePropagate $ "SubscriberPush" <> showNodeId subscribed
981+ occ <- runComputeM $ compute a
983+ Nothing -> return () -- No need to write a Nothing back into the Ref
985+ liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
986+ scheduleClear $ pushSubscribedOccurrence subscribed
987+ propagate o $ pushSubscribedSubscribers subscribed
988+ SubscriberMerge k subscribed -> {-# SCC "traverseMerge" #-} do
989+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
990+ oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
991+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
992+ tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
993+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
994+ when (DMap.null oldM) $ do -- Only schedule the firing once
995+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
996+ --TODO: assertions about height
997+ currentHeight <- getCurrentHeight
998+ when (height <= currentHeight) $ do
999+ myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
1000+ if height /= invalidHeight
1001+ then error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1003+ nodesInvolvedInCycle <- walkInvalidHeightParents $ EventSubscribedMerge subscribed
1004+ stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
1005+ error $ "Causality loop found:\n" <> drawForest (listsToForest stacks)
1006+ scheduleMerge height subscribed
1007+ SubscriberMergeChange subscribed -> {-# SCC "traverseMergeChange" #-} do
1008+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
1009+ defer $ SomeMergeUpdate a subscribed
1010+ SubscriberFan subscribed -> {-# SCC "traverseFan" #-} do
1011+ subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
1012+ tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
1013+ --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
1014+ forM_ (DMap.toList a) $ \(k :=> Identity v) -> {-# SCC "SubscriberFan" #-} case DMap.lookup k subs of
1016+ tracePropagate "No subscriber for key"
1019+ propagate v $ _fanSubscribedChildren_list subsubs
1021+ SubscriberHold h -> {-# SCC "traverseHold" #-} propagateSubscriberHold h a
1022+ SubscriberHoldIdentity h -> {-# SCC "traverseHoldIdentity" #-} propagateSubscriberHold h a
1023+ SubscriberSwitch subscribed -> {-# SCC "traverseSwitch" #-} do
1024+ tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
1025+ liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $! Just a
1026+ scheduleClear $ switchSubscribedOccurrence subscribed
1027+ propagate a $ switchSubscribedSubscribers subscribed
1028+ SubscriberCoincidenceOuter subscribed -> {-# SCC "traverseCoincidenceOuter" #-} do
1029+ tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
1030+ outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
1031+ tracePropagate $ " outerHeight = " <> show outerHeight
1032+ (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
1033+ tracePropagate $ " isJust occ = " <> show (isJust occ)
1034+ tracePropagate $ " innerHeight = " <> show innerHeight
1035+ liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $! Just innerSubd
1036+ scheduleClear $ coincidenceSubscribedInnerParent subscribed
1039+ when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
1040+ writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
1041+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
1042+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
1043+ Just o -> do -- Since it's already firing, no need to adjust height
1044+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
1045+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
1046+ propagate o $ coincidenceSubscribedSubscribers subscribed
1047+ SubscriberCoincidenceInner subscribed -> {-# SCC "traverseCoincidenceInner" #-} do
1048+ tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
1049+ occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
1051+ Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
1053+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $! Just a
1054+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
1055+ propagate a $ coincidenceSubscribedSubscribers subscribed
1056+ SubscriberHandle -> {-# SCC "traverseHandle" #-} tracePropagate "SubscriberHandle"
1498{-# INLINE propagateSubscriberHold #-}
1058{-# INLINE propagateSubscriberHold #-}
1499−propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
1059+propagateSubscriberHold :: R.Patch p => Hold p a -> p a -> EventM x ()
1500propagateSubscriberHold h a = do
1060propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1061+ {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
1502 invalidators <- liftIO $ readIORef $ holdInvalidators h
1062 invalidators <- liftIO $ readIORef $ holdInvalidators h
1503 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1063 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1505 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1064 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1506− case {-# SCC "apply" #-} apply a v of
1065+ case {-# SCC "apply" #-} R.apply a v of
1507 Nothing -> return ()
1066 Nothing -> return ()
1508 Just v' -> do
1067 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510− tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1068+ {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
1511 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
1069 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
1512 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
1070 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
1513 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
1071 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
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
1073+data SomeResetCoincidence = forall a. SomeResetCoincidence !(EventSubscription a) !(Maybe (CoincidenceSubscribed a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1075+{-# INLINE subscribeCoincidenceInner #-}
1076+subscribeCoincidenceInner :: CanSubscribe x m => Event a -> Height -> CoincidenceSubscribed a -> m (Maybe a, Height, EventSubscribed a)
1077+subscribeCoincidenceInner o outerHeight subscribedUnsafe = do
1078+ subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
1079+ subscription@(EventSubscription _ innerSubd) <- subscribe o subInner
1080+ innerOcc <- liftIO $ readEventSubscribed innerSubd
1081+ innerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef innerSubd
1082+ let height = max innerHeight outerHeight
1083+ defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
1084+ return (innerOcc, height, innerSubd)
1086+{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> BehaviorM a #-}
1087+{-# SPECIALIZE readBehaviorUntracked :: Behavior a -> EventM x a #-}
1088+readBehaviorUntracked :: Defer SomeHoldInit m => Behavior a -> m a
1089+readBehaviorUntracked b = do
1090+ holdInits <- getDeferralQueue
1091+ liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
1093+runBehaviorM :: BehaviorM a -> Maybe (Weak Invalidator, IORef [SomeBehaviorSubscribed]) -> IORef [SomeHoldInit] -> IO a
1094+runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
1096+askInvalidator :: BehaviorM (Maybe (Weak Invalidator))
1097+askInvalidator = liftM (fmap fst . fst) $ BehaviorM ask
1517−runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1099+askParentsRef :: BehaviorM (Maybe (IORef [SomeBehaviorSubscribed]))
1518−runBehaviorM a mwi holdInits = runReaderIO (unBehaviorM a) (mwi, holdInits)
1100+askParentsRef = liftM (fmap snd . fst) $ BehaviorM ask
1520−askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
1102+askBehaviorHoldInits :: BehaviorM (IORef [SomeHoldInit])
1521−askInvalidator = do
1103+askBehaviorHoldInits = liftM snd $ BehaviorM ask
1524− Nothing -> return Nothing
1525− Just (!wi, _) -> return $ Just wi
1527−askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
1105+readBehaviorTracked :: Behavior a -> BehaviorM a
1528−askParentsRef = do
1106+readBehaviorTracked b = case b of
1529− (!m, _) <- ask
1107+ BehaviorHold h -> readHoldTracked h
1530− case m of
1108+ BehaviorHoldIdentity h -> readHoldTracked h
1531− Nothing -> return Nothing
1109+ BehaviorConst a -> return a
1110+ BehaviorPull p -> do
1111+ val <- liftIO $ readIORef $ pullValue p
1113+ Just subscribed -> do
1114+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1115+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
1116+ liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
1117+ return $ pullSubscribedValue subscribed
1119+ i <- liftIO $ newInvalidatorPull p
1120+ wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
1121+ parentsRef <- liftIO $ newIORef []
1122+ holdInits <- askBehaviorHoldInits
1123+ a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
1124+ invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
1125+ parents <- liftIO $ readIORef parentsRef
1126+ let subscribed = PullSubscribed
1127+ { pullSubscribedValue = a
1128+ , pullSubscribedInvalidators = invsRef
1129+ , pullSubscribedOwnInvalidator = i
1130+ , pullSubscribedParents = parents
1132+ liftIO $ writeIORef (pullValue p) $! Just subscribed
1133+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1532− Just (_, !p) -> return $ Just p
1134+ return a
1135+ BehaviorDyn d -> readHoldTracked =<< getDynHold d
1136+ BehaviorDynIdentity d -> readHoldTracked =<< getDynHold d
1534−askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1138+{-# INLINE readHoldTracked #-}
1535−askBehaviorHoldInits = do
1139+readHoldTracked :: Hold p a -> BehaviorM a
1536− (_, !his) <- ask
1140+readHoldTracked h = do
1141+ result <- liftIO $ readIORef $ holdValue h
1142+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
1143+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
1537− return his
1144+ return result
1539{-# INLINE getDynHold #-}
1146{-# INLINE getDynHold #-}
1540−getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
1147+getDynHold :: (Defer SomeHoldInit m, R.Patch p) => Dyn p a -> m (Hold p a)
1541getDynHold d = do
1148getDynHold d = do
1542 mh <- liftIO $ readIORef $ unDyn d
1149 mh <- liftIO $ readIORef $ unDyn d
1543 case mh of
1150 case mh of
1544− HoldDyn h -> return h
1151+ Right h -> return h
1545− UnsafeDyn (readV0, v') -> do
1152+ Left (readV0, v') -> do
1546 holdInits <- getDeferralQueue
1153 holdInits <- getDeferralQueue
1547 v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1154 v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1549− BuildDyn (readV0, v') -> do
1550− v0 <- liftIO $ runEventM readV0
1554 h <- hold v0 v'
1155 h <- hold v0 v'
1555− liftIO $ writeIORef (unDyn d) $ HoldDyn h
1156+ liftIO $ writeIORef (unDyn d) $! Right h
1556 return h
1157 return h
1160+readEvent :: Event a -> ResultM (Maybe a)
1161+readEvent e = case e of
1162+ EventRoot k r -> liftIO . liftM (coerce . DMap.lookup k) . readIORef $ rootOccurrence r
1163+ EventNever -> return Nothing
1165+ subscribed <- getPushSubscribed p
1166+ liftIO $ readPushSubscribed subscribed
1168+ subscribed <- getMergeSubscribed m
1169+ liftIO $ readMergeSubscribed subscribed
1171+ subscribed <- getFanSubscribed f
1172+ liftIO $ readFanSubscribed k subscribed
1173+ EventSwitch s -> do
1174+ subscribed <- getSwitchSubscribed s
1175+ liftIO $ readSwitchSubscribed subscribed
1176+ EventCoincidence c -> do
1177+ subscribed <- getCoincidenceSubscribed c
1178+ liftIO $ readCoincidenceSubscribed subscribed
1179+ EventHold h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1180+ EventDyn d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1181+ EventHoldIdentity h -> liftIO . readEventSubscribed =<< getHoldEventSubscription h
1182+ EventDynIdentity d -> liftIO . readEventSubscribed =<< getHoldEventSubscription =<< getDynHold d
1185+readEventSubscribed :: EventSubscribed a -> IO (Maybe a)
1186+readEventSubscribed = \case
1187+ EventSubscribedRoot rs -> readRootSubscribed rs
1188+ EventSubscribedNever -> return Nothing
1189+ EventSubscribedPush ps -> readPushSubscribed ps
1190+ EventSubscribedMerge ms -> readMergeSubscribed ms
1191+ EventSubscribedFan k fs -> readFanSubscribed k fs
1192+ EventSubscribedSwitch ss -> readSwitchSubscribed ss
1193+ EventSubscribedCoincidence cs -> readCoincidenceSubscribed cs
1195+readRootSubscribed :: RootSubscribed a -> IO (Maybe a)
1196+readRootSubscribed = rootSubscribedOccurrence
1198+readPushSubscribed :: PushSubscribed b a -> IO (Maybe a)
1199+readPushSubscribed subscribed = do
1200+ result <- readIORef $ pushSubscribedOccurrence subscribed -- Since ResultM is always called after the final height is reached, this will always be valid
1201+ touch $ pushSubscribedSelf subscribed
1204+readMergeSubscribed :: MergeSubscribed k -> IO (Maybe (DMap k Identity))
1205+readMergeSubscribed subscribed = do
1206+ result <- readIORef $ mergeSubscribedOccurrence subscribed
1207+ touch $ mergeSubscribedParents subscribed
1210+readFanSubscribed :: GCompare k => k a -> FanSubscribed k -> IO (Maybe a)
1211+readFanSubscribed k fs = do
1212+ parentOcc <- readEventSubscribed $ _eventSubscription_subscribed $ fanSubscribedParent fs
1213+ return $ coerce $ DMap.lookup k =<< parentOcc
1215+readSwitchSubscribed :: SwitchSubscribed a -> IO (Maybe a)
1216+readSwitchSubscribed subscribed = do
1217+ result <- readIORef $ switchSubscribedOccurrence subscribed
1218+ touch $ switchSubscribedOwnInvalidator subscribed
1221+readCoincidenceSubscribed :: CoincidenceSubscribed a -> IO (Maybe a)
1222+readCoincidenceSubscribed subscribed = do
1223+ result <- readIORef $ coincidenceSubscribedOccurrence subscribed
1224+ touch $ coincidenceSubscribedOuter subscribed
1225+ --TODO: do we need to touch the inner subscriber?
1559-- Always refers to 0
1228-- Always refers to 0
1560{-# NOINLINE zeroRef #-}
1229{-# NOINLINE zeroRef #-}
1561zeroRef :: IORef Height
1230zeroRef :: IORef Height
1562zeroRef = unsafePerformIO $ newIORef zeroHeight
1231zeroRef = unsafePerformIO $ newIORef zeroHeight
1233+{-# SPECIALIZE subscribe :: Event a -> Subscriber a -> EventM x (EventSubscription a) #-}
1234+subscribe :: forall x m a. CanSubscribe x m => Event a -> Subscriber a -> m (EventSubscription a)
1235+subscribe e sub = case e of
1236+ EventRoot k r -> wrap EventSubscribedRoot $ liftIO . getRootSubscribed k r
1237+ EventNever -> return $ EventSubscription Nothing EventSubscribedNever
1238+ EventPush p -> wrap EventSubscribedPush $ getPushSubscribed p
1239+ EventFan k f -> wrap (EventSubscribedFan k) $ getFanSubscribed k f
1240+ EventMerge m -> wrap EventSubscribedMerge $ getMergeSubscribed m
1241+ EventSwitch s -> wrap EventSubscribedSwitch $ getSwitchSubscribed s
1242+ EventCoincidence c -> wrap EventSubscribedCoincidence $ getCoincidenceSubscribed c
1243+ EventHold h -> subscribeHoldEvent h sub
1244+ EventDyn j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1245+ EventHoldIdentity h -> subscribeHoldEvent h sub
1246+ EventDynIdentity j -> getDynHold j >>= \h -> subscribeHoldEvent h sub
1248+ wrap :: (t -> EventSubscribed a) -> (Subscriber a -> m (SubscriberListTicket a, t)) -> m (EventSubscription a)
1249+ wrap tag getSpecificSubscribed = do
1250+ (sln, subd) <- getSpecificSubscribed sub
1251+ return $ EventSubscription (Just sln) $ tag subd
1253+{-# INLINE subscribeHoldEvent #-}
1254+subscribeHoldEvent :: (CanSubscribe x m, R.Patch p) => Hold p a -> Subscriber (p a) -> m (EventSubscription (p a))
1255+subscribeHoldEvent h sub = do
1256+ EventSubscription _ subd <- getHoldEventSubscription h
1257+ sln <- liftIO $ subscribeEventSubscribed subd sub
1258+ return $ EventSubscription sln subd
1260+{-# INLINE debugSubscribe #-}
1261+debugSubscribe :: Bool
1262+debugSubscribe = False
1264+{-# INLINE subscribeEventSubscribed #-}
1265+subscribeEventSubscribed :: EventSubscribed a -> Subscriber a -> IO (Maybe (SubscriberListTicket a))
1266+subscribeEventSubscribed es sub = case es of
1267+ EventSubscribedRoot r -> do
1268+ traceSubscribe $ "subscribeEventSubscribed Root"
1269+ fmap Just $ subscribeRootSubscribed r sub
1270+ EventSubscribedNever -> do
1271+ traceSubscribe $ "subscribeEventSubscribed Never"
1273+ EventSubscribedPush subscribed -> do
1274+ traceSubscribe $ "subscribeEventSubscribed Push"
1275+ fmap Just $ subscribePushSubscribed subscribed sub
1276+ EventSubscribedFan k subscribed -> do
1277+ traceSubscribe $ "subscribeEventSubscribed Fan"
1278+ fmap Just $ subscribeFanSubscribed k subscribed sub
1279+ EventSubscribedMerge subscribed -> do
1280+ traceSubscribe $ "subscribeEventSubscribed Merge"
1281+ fmap Just $ subscribeMergeSubscribed subscribed sub
1282+ EventSubscribedSwitch subscribed -> do
1283+ traceSubscribe $ "subscribeEventSubscribed Switch"
1284+ fmap Just $ subscribeSwitchSubscribed subscribed sub
1285+ EventSubscribedCoincidence subscribed -> do
1286+ traceSubscribe $ "subscribeEventSubscribed Coincidence"
1287+ fmap Just $ subscribeCoincidenceSubscribed subscribed sub
1289+{-# INLINE eventSubscribedHeightRef #-}
1290+eventSubscribedHeightRef :: EventSubscribed a -> IORef Height
1291+eventSubscribedHeightRef = \case
1292+ EventSubscribedRoot _ -> zeroRef
1293+ EventSubscribedNever -> zeroRef
1294+ EventSubscribedPush subscribed -> pushSubscribedHeight subscribed
1295+ EventSubscribedFan _ subscribed -> eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
1296+ EventSubscribedMerge subscribed -> mergeSubscribedHeight subscribed
1297+ EventSubscribedSwitch subscribed -> switchSubscribedHeight subscribed
1298+ EventSubscribedCoincidence subscribed -> coincidenceSubscribedHeight subscribed
1300+{-# INLINE eventSubscribedHasOwnHeightRef #-}
1301+eventSubscribedHasOwnHeightRef :: EventSubscribed a -> Bool
1302+eventSubscribedHasOwnHeightRef = \case
1303+ EventSubscribedRoot _ -> False
1304+ EventSubscribedNever -> False
1305+ EventSubscribedPush _ -> False
1306+ EventSubscribedFan _ _ -> False
1307+ EventSubscribedMerge _ -> True
1308+ EventSubscribedSwitch _ -> True
1309+ EventSubscribedCoincidence _ -> True
1311+{-# INLINE eventSubscribedGetParents #-}
1312+eventSubscribedGetParents :: EventSubscribed a -> IO [Some EventSubscribed]
1313+eventSubscribedGetParents = \case
1314+ EventSubscribedRoot _ -> return []
1315+ EventSubscribedNever -> return []
1316+ EventSubscribedPush subscribed -> return [Some.This $ _eventSubscription_subscribed $ pushSubscribedParent subscribed]
1317+ EventSubscribedFan _ subscribed -> return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
1318+ EventSubscribedMerge subscribed -> do
1319+ ps <- readIORef $ mergeSubscribedParents subscribed
1320+ return $ fmap (\(_ :=> v) -> Some.This $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription v) $ DMap.toList ps
1321+ EventSubscribedSwitch subscribed -> do
1322+ s <- readIORef $ switchSubscribedCurrentParent subscribed
1323+ return [Some.This $ _eventSubscription_subscribed s]
1324+ EventSubscribedCoincidence subscribed -> do
1325+ innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
1326+ let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1327+ innerParents = maybeToList $ fmap Some.This innerSubscription
1328+ return $ outerParent : innerParents
1330+type CanSubscribe x m =
1332+ , HasCurrentHeight m
1333+ , Defer SomeHoldInit m, Defer SomeMergeInit m -- The things we need to lazily initialize state
1334+ , Defer SomeClear m -- Wiping out event firings
1335+ , Defer SomeAssignment m -- Updating state
1336+ , Defer SomeResetCoincidence m
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)
1339+getRootSubscribed :: GCompare k => k a -> Root k -> Subscriber a -> IO (SubscriberListTicket a, RootSubscribed a)
1565getRootSubscribed k r sub = do
1340getRootSubscribed k r sub = do
1566 mSubscribed <- readIORef $ rootSubscribed r
1341 mSubscribed <- readIORef $ rootSubscribed r
1567− let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
1568 case DMap.lookup k mSubscribed of
1342 case DMap.lookup k mSubscribed of
1569 Just subscribed -> {-# SCC "hitRoot" #-} do
1343 Just subscribed -> {-# SCC "hitRoot" #-} do
1570 sln <- subscribeRootSubscribed subscribed sub
1344 sln <- subscribeRootSubscribed subscribed sub
1572− return (sln, subscribed, occ)
1345+ return (sln, subscribed)
1573 Nothing -> {-# SCC "missRoot" #-} do
1346 Nothing -> {-# SCC "missRoot" #-} do
1574 weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
1347 weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
1575 let !cached = rootSubscribed r
1348 let !cached = rootSubscribed r
1576 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
1349 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
1577 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1350 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1579− tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1351+ when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
1581 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
1352 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
1582 writeIORef uninitRef $! uninit
1353 writeIORef uninitRef $! uninit
1583−#ifdef DEBUG_NODEIDS
1586− let !subscribed = RootSubscribed
1354+ let subscribed = RootSubscribed
1587 { rootSubscribedKey = k
1355 { rootSubscribedKey = k
1588 , rootSubscribedCachedSubscribed = cached
1356 , rootSubscribedCachedSubscribed = cached
1589− , rootSubscribedOccurrence = getOcc
1357+ , rootSubscribedOccurrence = liftM (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
1590 , rootSubscribedSubscribers = subs
1358 , rootSubscribedSubscribers = subs
1591 , rootSubscribedUninit = uninit
1359 , rootSubscribedUninit = uninit
1592 , rootSubscribedWeakSelf = weakSelf
1360 , rootSubscribedWeakSelf = weakSelf
1593#ifdef DEBUG_NODEIDS
1361#ifdef DEBUG_NODEIDS
1594− , rootSubscribedNodeId = nid
1362+ , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
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)
1607− writeIORef weakSelf =<< evaluate =<< mkWeakPtr subscribed (Just finalCleanup)
1365+ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
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
1366 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
1610− return (sln, subscribed, occ)
1367+ return (sln, subscribed)
1612−#ifdef USE_TEMPLATE_HASKELL
1613−{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1615−cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1369+cleanupRootSubscribed :: RootSubscribed a -> IO ()
1616−cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
1370+cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
1617 rootSubscribedUninit self
1371 rootSubscribedUninit self
1618 modifyIORef' cached $ DMap.delete k
1372 modifyIORef' cached $ DMap.delete k
1620{-# INLINE subscribeRootSubscribed #-}
1374{-# INLINE subscribeRootSubscribed #-}
1621−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1375+subscribeRootSubscribed :: RootSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
1622subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
1376subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
1624−newtype EventSelectorInt x a = EventSelectorInt { selectInt :: Int -> Event x a }
1378+-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1625−
1379+{-# SPECIALIZE getPushSubscribed :: Push a b -> Subscriber b -> EventM x (SubscriberListTicket b, PushSubscribed a b) #-}
1626−data FanInt x a = FanInt
1380+getPushSubscribed :: CanSubscribe x m => Push a b -> Subscriber b -> m (SubscriberListTicket b, PushSubscribed a b)
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
1381+getPushSubscribed p sub = do
1628− , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
1382+ mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1629− , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
1383+ case mSubscribed of
1630−#ifdef DEBUG_NODEIDS
1384+ Just subscribed -> {-# SCC "hitPush" #-} do
1631− , _fanInt_nodeId :: {-# UNPACK #-} !Int
1385+ sln <- liftIO $ subscribePushSubscribed subscribed sub
1632−#endif
1386+ return (sln, subscribed)
1633− }
1387+ Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1634−
1388+ subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1635−newFanInt :: IO (FanInt x a)
1389+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1636−newFanInt = do
1390+ s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
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
1391+ subscription@(EventSubscription _ subd) <- subscribe (pushParent p) s
1638− subscriptionRef <- newIORef $ error "fanInt: no subscription"
1392+ parentOcc <- liftIO $ readEventSubscribed subd
1639− occRef <- newIORef $ error "fanInt: no occurrence"
1393+ occ <- runComputeM $ liftM join $ mapM (pushCompute p) parentOcc
1394+ occRef <- liftIO $ newIORef occ
1395+ when (isJust occ) $ scheduleClear occRef
1396+ weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1397+ let !cached = pushSubscribed p
1398+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1399+ let subscribed = PushSubscribed
1400+ { pushSubscribedCachedSubscribed = cached
1401+ , pushSubscribedOccurrence = occRef
1402+ , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1403+ , pushSubscribedSubscribers = subs
1404+ , pushSubscribedSelf = s
1405+ , pushSubscribedWeakSelf = weakSelf
1406+ , pushSubscribedParent = subscription
1640#ifdef DEBUG_NODEIDS
1407#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1408+ , pushSubscribedNodeId = unsafeNodeId p
1643− return $ FanInt
1410+ }
1644− { _fanInt_subscribers = subscribers
1411+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1645− , _fanInt_subscriptionRef = subscriptionRef
1412+ liftIO $ writeIORef subscribedRef $! subscribed
1646− , _fanInt_occRef = occRef
1413+ liftIO $ writeIORef (pushSubscribed p) $! Just subscribed
1414+ return (sln, subscribed)
1416+cleanupPushSubscribed :: PushSubscribed a b -> IO ()
1417+cleanupPushSubscribed self = do
1418+ unsubscribe $ pushSubscribedParent self
1419+ writeIORef (pushSubscribedCachedSubscribed self) $! Nothing
1421+{-# INLINE subscribePushSubscribed #-}
1422+subscribePushSubscribed :: PushSubscribed a b -> Subscriber b -> IO (SubscriberListTicket b)
1423+subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1425+{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge k -> Subscriber (DMap k Identity) -> EventM x (SubscriberListTicket (DMap k Identity), MergeSubscribed k) #-}
1426+getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge k -> Subscriber (DMap k Identity) -> m (SubscriberListTicket (DMap k Identity), MergeSubscribed k)
1427+getMergeSubscribed m sub = do
1428+ mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1429+ case mSubscribed of
1430+ Just subscribed -> {-# SCC "hitMerge" #-} do
1431+ sln <- liftIO $ subscribeMergeSubscribed subscribed sub
1432+ return (sln, subscribed)
1433+ Nothing -> {-# SCC "missMerge" #-} do
1434+ subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1435+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1436+ initialParents <- readBehaviorUntracked $ current $ mergeParents m
1437+ subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1438+ s <- liftIO $ newSubscriberMerge k subscribedUnsafe
1439+ subscription@(EventSubscription _ parentSubd) <- subscribe e s
1440+ parentOcc <- liftIO $ readEventSubscribed parentSubd
1441+ height <- liftIO $ readIORef $ eventSubscribedHeightRef parentSubd
1442+ return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> (MergeSubscribedParent subscription s))
1443+ let dm = DMap.fromDistinctAscList $ catMaybes $ map (\(x, _, _) -> x) subscribers
1444+ heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1445+ myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1446+ myHeight = if any (== invalidHeight) heights
1448+ else succHeight $ heightBagMax myHeightBag
1449+ currentHeight <- getCurrentHeight
1450+ let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1451+ then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1453+ when (not $ DMap.null accum) $ do
1454+ scheduleMerge myHeight subscribedUnsafe
1455+ occRef <- liftIO $ newIORef occ
1456+ when (isJust occ) $ scheduleClear occRef
1457+ accumRef <- liftIO $ newIORef accum
1458+ heightRef <- liftIO $ newIORef myHeight
1459+ heightMapRef <- liftIO $ newIORef myHeightBag
1460+ weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1461+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1462+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1463+ parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1464+ let !subscribed = MergeSubscribed
1465+ { mergeSubscribedCachedSubscribed = mergeSubscribed m
1466+ , mergeSubscribedOccurrence = occRef
1467+ , mergeSubscribedAccum = accumRef
1468+ , mergeSubscribedHeight = heightRef
1469+ , mergeSubscribedHeightBag = heightMapRef
1470+ , mergeSubscribedSubscribers = subs
1471+ , mergeSubscribedChange = changeSubdRef
1472+ , mergeSubscribedParents = parentsRef
1473+ , mergeSubscribedWeakSelf = weakSelf
1647#ifdef DEBUG_NODEIDS
1474#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1475+ , mergeSubscribedNodeId = unsafeNodeId m
1652−fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
1653−fanInt p = unsafePerformIO $ do
1655− pure $ EventSelectorInt $ \k -> Event $ \sub -> do
1656− isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
1657− when isEmpty $ do -- This is the first subscriber, so we need to subscribe to our input
1658− let desc = "fanInt" <> showNodeId self <> ", k = " <> show k
1659− (subscription, parentOcc) <- subscribeAndRead p $ debugSubscriber' desc $ Subscriber
1660− { subscriberPropagate = \m -> do
1661− liftIO $ writeIORef (_fanInt_occRef self) m
1662− scheduleIntClear $ _fanInt_occRef self
1663− FastMutableIntMap.forIntersectionWithImmutable_ (_fanInt_subscribers self) m $ \b v -> --TODO: Do we need to know that no subscribers are being added as we traverse?
1664− FastWeakBag.traverse_ b $ \s ->
1665− subscriberPropagate s v
1666− , subscriberInvalidateHeight = \old ->
1667− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1668− FastWeakBag.traverse_ b $ \s ->
1669− subscriberInvalidateHeight s old
1670− , subscriberRecalculateHeight = \new ->
1671− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1672− FastWeakBag.traverse_ b $ \s ->
1673− subscriberRecalculateHeight s new
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
1704−
1478+ defer $ SomeMergeInit subscribed $ updated $ mergeParents m
1705−
1479+ liftIO $ writeIORef subscribedRef $! subscribed
1706−{-# INLINABLE getFanSubscribed #-}
1480+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1481+ liftIO $ writeIORef (mergeSubscribed m) $! Just subscribed
1482+ return (sln, subscribed)
1484+cleanupMergeSubscribed :: MergeSubscribed k -> IO ()
1485+cleanupMergeSubscribed subscribed = do
1486+ parents <- readIORef $ mergeSubscribedParents subscribed
1487+ forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1488+ -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1489+ writeIORef (mergeSubscribedCachedSubscribed subscribed) $! Nothing -- Get rid of the cached subscribed
1491+{-# INLINE subscribeMergeSubscribed #-}
1492+subscribeMergeSubscribed :: MergeSubscribed k -> Subscriber (DMap k Identity) -> IO (SubscriberListTicket (DMap k Identity))
1493+subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
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))
1495+{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan k -> Subscriber a -> EventM x (SubscriberListTicket a, FanSubscribed k) #-}
1496+getFanSubscribed :: (Defer SomeAssignment m, Defer SomeHoldInit m, Defer SomeMergeInit m, Defer SomeClear m, HasCurrentHeight m, Defer SomeResetCoincidence m, HasSpiderEnv x m, GCompare k) => k a -> Fan k -> Subscriber a -> m (SubscriberListTicket a, FanSubscribed k)
1708getFanSubscribed k f sub = do
1497getFanSubscribed k f sub = do
1709 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
1498 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
1710 case mSubscribed of
1499 case mSubscribed of
1711− Just subscribed -> {-# SCC "hitFan" #-} liftIO $ do
1500+ Just subscribed -> {-# SCC "hitFan" #-} do
1712− sln <- subscribeFanSubscribed k subscribed sub
1501+ sln <- liftIO $ subscribeFanSubscribed k subscribed sub
1713− occ <- readIORef $ fanSubscribedOccurrence subscribed
1714− return (sln, subscribed, coerce $ DMap.lookup k =<< occ)
1502+ return (sln, subscribed)
1715 Nothing -> {-# SCC "missFan" #-} do
1503 Nothing -> {-# SCC "missFan" #-} do
1716 subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
1504 subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
1717 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1505 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1718 s <- liftIO $ newSubscriberFan subscribedUnsafe
1506 s <- liftIO $ newSubscriberFan subscribedUnsafe
1719− (subscription, parentOcc) <- subscribeAndRead (fanParent f) s
1507+ subscription <- subscribe (fanParent f) s
1720 weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
1508 weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
1721 (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
1509 (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
1722 subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
1510 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
1728 let subscribed = FanSubscribed
1511 let subscribed = FanSubscribed
1729 { fanSubscribedCachedSubscribed = fanSubscribed f
1512 { fanSubscribedCachedSubscribed = fanSubscribed f
1730− , fanSubscribedOccurrence = occRef
1731 , fanSubscribedParent = subscription
1513 , fanSubscribedParent = subscription
1732 , fanSubscribedSubscribers = subscribersRef
1514 , fanSubscribedSubscribers = subscribersRef
1733#ifdef DEBUG_NODEIDS
1515#ifdef DEBUG_NODEIDS
1734− , fanSubscribedNodeId = nid
1516+ , fanSubscribedNodeId = unsafeNodeId f
1737 let !self = (k, subscribed)
1519 let !self = (k, subscribed)
1738 liftIO $ writeIORef subscribersRef $! DMap.singleton k $ FanSubscribedChildren subsForK self weakSelf
1520 liftIO $ writeIORef subscribersRef $! DMap.singleton k $ FanSubscribedChildren subsForK self weakSelf
1739 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
1521 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
1740 liftIO $ writeIORef subscribedRef $! subscribed
1522 liftIO $ writeIORef subscribedRef $! subscribed
1741− liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1523+ liftIO $ writeIORef (fanSubscribed f) $! Just subscribed
1742− return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
1524+ return (slnForSub, subscribed)
1744−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
1526+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed k) -> IO ()
1745cleanupFanSubscribed (k, subscribed) = do
1527cleanupFanSubscribed (k, subscribed) = do
1746 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1528 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1747 let reducedSubscribers = DMap.delete k subscribers
1529 let reducedSubscribers = DMap.delete k subscribers
@@ -1749,11 +1531,11 @@ cleanupFanSubscribed (k, subscribed) = do
1750 unsubscribe $ fanSubscribedParent subscribed
1532 unsubscribe $ fanSubscribedParent subscribed
1751 -- Not necessary in this case, because this whole FanSubscribed is dead: writeIORef (fanSubscribedSubscribers subscribed) reducedSubscribers
1533 -- Not necessary in this case, because this whole FanSubscribed is dead: writeIORef (fanSubscribedSubscribers subscribed) reducedSubscribers
1752− writeIORef (fanSubscribedCachedSubscribed subscribed) Nothing
1534+ writeIORef (fanSubscribedCachedSubscribed subscribed) $! Nothing
1753 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
1535 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
1755{-# INLINE subscribeFanSubscribed #-}
1537{-# INLINE subscribeFanSubscribed #-}
1756−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
1538+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed k -> Subscriber a -> IO (SubscriberListTicket a)
1757subscribeFanSubscribed k subscribed sub = do
1539subscribeFanSubscribed k subscribed sub = do
1758 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1540 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1759 case DMap.lookup k subscribers of
1541 case DMap.lookup k subscribers of
@@ -1761,19 +1543,18 @@ subscribeFanSubscribed k subscribed sub = do
1761 let !self = (k, subscribed)
1543 let !self = (k, subscribed)
1762 weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
1544 weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
1763 (list, sln) <- WeakBag.singleton sub weakSelf cleanupFanSubscribed
1545 (list, sln) <- WeakBag.singleton sub weakSelf cleanupFanSubscribed
1764− writeIORef (fanSubscribedSubscribers subscribed) $! DMap.insertWith (error "subscribeFanSubscribed: key that we just failed to find is present - should be impossible") k (FanSubscribedChildren list self weakSelf) subscribers
1546+ writeIORef (fanSubscribedSubscribers subscribed) $! DMap.insertWith (error "subscribeEventSubscribed: key that we just failed to find is present - should be impossible") k (FanSubscribedChildren list self weakSelf) subscribers
1765 return sln
1547 return sln
1766 Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
1548 Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
1768−{-# INLINABLE getSwitchSubscribed #-}
1550+{-# SPECIALIZE getSwitchSubscribed :: Switch a -> Subscriber a -> EventM x (SubscriberListTicket a, SwitchSubscribed a) #-}
1769−getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1551+getSwitchSubscribed :: (Defer SomeHoldInit m, Defer SomeAssignment m, Defer SomeMergeInit m, Defer SomeClear m, Defer SomeResetCoincidence m, HasCurrentHeight m, HasSpiderEnv x m) => Switch a -> Subscriber a -> m (SubscriberListTicket a, SwitchSubscribed a)
1770getSwitchSubscribed s sub = do
1552getSwitchSubscribed s sub = do
1771 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
1553 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
1772 case mSubscribed of
1554 case mSubscribed of
1773− Just subscribed -> {-# SCC "hitSwitch" #-} liftIO $ do
1555+ Just subscribed -> {-# SCC "hitSwitch" #-} do
1774− sln <- subscribeSwitchSubscribed subscribed sub
1556+ sln <- liftIO $ subscribeSwitchSubscribed subscribed sub
1775− occ <- readIORef $ switchSubscribedOccurrence subscribed
1776− return (sln, subscribed, occ)
1557+ return (sln, subscribed)
1777 Nothing -> {-# SCC "missSwitch" #-} do
1558 Nothing -> {-# SCC "missSwitch" #-} do
1778 subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
1559 subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
1779 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1560 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
@@ -1784,16 +1565,14 @@ getSwitchSubscribed s sub = do
1784 parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
1565 parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
1785 holdInits <- getDeferralQueue
1566 holdInits <- getDeferralQueue
1786 e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1567 e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1787− (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead e mySub
1568+ subscription@(EventSubscription _ subd) <- subscribe e mySub
1788− heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
1789 subscriptionRef <- liftIO $ newIORef subscription
1569 subscriptionRef <- liftIO $ newIORef subscription
1570+ parentOcc <- liftIO $ readEventSubscribed subd
1790 occRef <- liftIO $ newIORef parentOcc
1571 occRef <- liftIO $ newIORef parentOcc
1791 when (isJust parentOcc) $ scheduleClear occRef
1572 when (isJust parentOcc) $ scheduleClear occRef
1573+ heightRef <- liftIO $ newIORef =<< readIORef (eventSubscribedHeightRef subd)
1792 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
1574 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
1793 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1575 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794−#ifdef DEBUG_NODEIDS
1795− nid <- liftIO newNodeId
1797 let !subscribed = SwitchSubscribed
1576 let !subscribed = SwitchSubscribed
1798 { switchSubscribedCachedSubscribed = switchSubscribed s
1577 { switchSubscribedCachedSubscribed = switchSubscribed s
1799 , switchSubscribedOccurrence = occRef
1578 , switchSubscribedOccurrence = occRef
@@ -1806,39 +1585,39 @@ getSwitchSubscribed s sub = do
1806 , switchSubscribedCurrentParent = subscriptionRef
1585 , switchSubscribedCurrentParent = subscriptionRef
1807 , switchSubscribedWeakSelf = weakSelf
1586 , switchSubscribedWeakSelf = weakSelf
1808#ifdef DEBUG_NODEIDS
1587#ifdef DEBUG_NODEIDS
1809− , switchSubscribedNodeId = nid
1588+ , switchSubscribedNodeId = unsafeNodeId s
1812 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
1591 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
1813 liftIO $ writeIORef subscribedRef $! subscribed
1592 liftIO $ writeIORef subscribedRef $! subscribed
1814− liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1593+ liftIO $ writeIORef (switchSubscribed s) $! Just subscribed
1815− return (slnForSub, subscribed, parentOcc)
1594+ return (slnForSub, subscribed)
1817−cleanupSwitchSubscribed :: SwitchSubscribed x a -> IO ()
1596+cleanupSwitchSubscribed :: SwitchSubscribed a -> IO ()
1818cleanupSwitchSubscribed subscribed = do
1597cleanupSwitchSubscribed subscribed = do
1819 unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
1598 unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
1820 finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
1599 finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
1821− writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
1600+ writeIORef (switchSubscribedCachedSubscribed subscribed) $! Nothing
1823{-# INLINE subscribeSwitchSubscribed #-}
1602{-# INLINE subscribeSwitchSubscribed #-}
1824−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1603+subscribeSwitchSubscribed :: SwitchSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
1825subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
1604subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
1827−{-# INLINABLE getCoincidenceSubscribed #-}
1606+{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence a -> Subscriber a -> EventM x (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)
1607+getCoincidenceSubscribed :: forall x a m. (Defer SomeAssignment m, Defer SomeHoldInit m, Defer SomeMergeInit m, Defer SomeClear m, HasCurrentHeight m, Defer SomeResetCoincidence m, HasSpiderEnv x m) => Coincidence a -> Subscriber a -> m (SubscriberListTicket a, CoincidenceSubscribed a)
1829getCoincidenceSubscribed c sub = do
1608getCoincidenceSubscribed c sub = do
1830 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
1609 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
1831 case mSubscribed of
1610 case mSubscribed of
1832− Just subscribed -> {-# SCC "hitCoincidence" #-} liftIO $ do
1611+ Just subscribed -> {-# SCC "hitCoincidence" #-} do
1833− sln <- subscribeCoincidenceSubscribed subscribed sub
1612+ sln <- liftIO $ subscribeCoincidenceSubscribed subscribed sub
1834− occ <- readIORef $ coincidenceSubscribedOccurrence subscribed
1835− return (sln, subscribed, occ)
1613+ return (sln, subscribed)
1836 Nothing -> {-# SCC "missCoincidence" #-} do
1614 Nothing -> {-# SCC "missCoincidence" #-} do
1837 subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
1615 subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
1838 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1616 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1839 subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1617 subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1840− (outerSubscription@(EventSubscription _ outerSubd), outerOcc) <- subscribeAndRead (coincidenceParent c) subOuter
1618+ outerSubscription@(EventSubscription _ outerSubd) <- subscribe (coincidenceParent c) subOuter
1619+ outerOcc <- liftIO $ readEventSubscribed outerSubd
1841− outerHeight <- liftIO $ getEventSubscribedHeight outerSubd
1620+ outerHeight <- liftIO $ readIORef $ eventSubscribedHeightRef outerSubd
1842 (occ, height, mInnerSubd) <- case outerOcc of
1621 (occ, height, mInnerSubd) <- case outerOcc of
1843 Nothing -> return (Nothing, outerHeight, Nothing)
1622 Nothing -> return (Nothing, outerHeight, Nothing)
1844 Just o -> do
1623 Just o -> do
@@ -1851,9 +1630,6 @@ getCoincidenceSubscribed c sub = do
1851 scheduleClear innerSubdRef
1630 scheduleClear innerSubdRef
1852 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
1631 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
1853 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1632 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854−#ifdef DEBUG_NODEIDS
1855− nid <- liftIO newNodeId
1857 let subscribed = CoincidenceSubscribed
1633 let subscribed = CoincidenceSubscribed
1858 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
1634 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
1859 , coincidenceSubscribedOccurrence = occRef
1635 , coincidenceSubscribedOccurrence = occRef
@@ -1864,549 +1640,166 @@ getCoincidenceSubscribed c sub = do
1864 , coincidenceSubscribedInnerParent = innerSubdRef
1640 , coincidenceSubscribedInnerParent = innerSubdRef
1865 , coincidenceSubscribedWeakSelf = weakSelf
1641 , coincidenceSubscribedWeakSelf = weakSelf
1866#ifdef DEBUG_NODEIDS
1642#ifdef DEBUG_NODEIDS
1867− , coincidenceSubscribedNodeId = nid
1643+ , coincidenceSubscribedNodeId = unsafeNodeId c
1870 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
1646 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
1871 liftIO $ writeIORef subscribedRef $! subscribed
1647 liftIO $ writeIORef subscribedRef $! subscribed
1872− liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1648+ liftIO $ writeIORef (coincidenceSubscribed c) $! Just subscribed
1873− return (slnForSub, subscribed, occ)
1649+ return (slnForSub, subscribed)
1875−cleanupCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO ()
1651+cleanupCoincidenceSubscribed :: CoincidenceSubscribed a -> IO ()
1876cleanupCoincidenceSubscribed subscribed = do
1652cleanupCoincidenceSubscribed subscribed = do
1877 unsubscribe $ coincidenceSubscribedOuterParent subscribed
1653 unsubscribe $ coincidenceSubscribedOuterParent subscribed
1878− writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
1654+ writeIORef (coincidenceSubscribedCachedSubscribed subscribed) $! Nothing
1880{-# INLINE subscribeCoincidenceSubscribed #-}
1656{-# INLINE subscribeCoincidenceSubscribed #-}
1881−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1657+subscribeCoincidenceSubscribed :: CoincidenceSubscribed a -> Subscriber a -> IO (SubscriberListTicket a)
1882subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
1658subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
1884−{-# INLINE mergeG #-}
1660+{-# INLINE merge #-}
1885−mergeG :: forall k q x v. (HasSpiderTimeline x, GCompare k)
1661+merge :: GCompare k => Dynamic R.PatchDMap (DMap k Event) -> Event (DMap k Identity)
1886− => (forall a. q a -> Event x (v a))
1662+merge m = EventMerge $ Merge
1887− -> DynamicS x (PatchDMap k q) -> Event x (DMap k v)
1663+ { mergeParents = m
1888−mergeG nt d = cacheEvent (mergeCheap nt d)
1664+ , mergeSubscribed = unsafeNewIORef m Nothing
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
2097−--TODO: Be able to run as much of this as possible promptly
1667+newtype EventSelector k = EventSelector { select :: forall a. k a -> Event a }
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
2279− return (EventSubscription unsubscribeAll subscribed, occ)
2281−newtype EventSelector x k = EventSelector { select :: forall a. k a -> Event x a }
1669+fan :: GCompare k => Event (DMap k Identity) -> EventSelector k
2282−newtype EventSelectorG x k v = EventSelectorG { selectG :: forall a. k a -> Event x (v a) }
1670+fan e =
2284−fanG :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k v) -> EventSelectorG x k v
2285−fanG e = unsafePerformIO $ do
2286− ref <- newIORef Nothing
2287 let f = Fan
1671 let f = Fan
2288 { fanParent = e
1672 { fanParent = e
2289− , fanSubscribed = ref
1673+ , fanSubscribed = unsafeNewIORef e Nothing
2291− pure $ EventSelectorG $ \k -> eventFan k f
1675+ in EventSelector $ \k -> EventFan k f
1677+{- SPECIALIZE runHoldInits :: IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> EventM x () #-}
2293−runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
1678+--runHoldInits :: (CanSubscribe x m, Defer SomeMergeUpdate m) => IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> m ()
1679+runHoldInits :: IORef [SomeHoldInit] -> IORef [SomeMergeInit] -> EventM x ()
2294−runHoldInits holdInitRef dynInitRef mergeInitRef = do
1680+runHoldInits holdInitRef mergeInitRef = do
2295 holdInits <- liftIO $ readIORef holdInitRef
1681 holdInits <- liftIO $ readIORef holdInitRef
2296− dynInits <- liftIO $ readIORef dynInitRef
2297 mergeInits <- liftIO $ readIORef mergeInitRef
1682 mergeInits <- liftIO $ readIORef mergeInitRef
2298− unless (null holdInits && null dynInits && null mergeInits) $ do
1683+ if null holdInits && null mergeInits then return () else do
2299− liftIO $ writeIORef holdInitRef []
1684+ liftIO $ writeIORef holdInitRef $! []
2300− liftIO $ writeIORef dynInitRef []
2301− liftIO $ writeIORef mergeInitRef []
1685+ liftIO $ writeIORef mergeInitRef $! []
2302 mapM_ initHold holdInits
1686 mapM_ initHold holdInits
2303− mapM_ initDyn dynInits
1687+ mapM_ initMerge mergeInits
2304− mapM_ unSomeMergeInit mergeInits
2305− runHoldInits holdInitRef dynInitRef mergeInitRef
1688+ runHoldInits holdInitRef mergeInitRef
2307−initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
1690+{- SPECIALIZE initHold :: SomeHoldInit -> EventM x () #-}
1691+--initHold :: CanSubscribe x m => SomeHoldInit -> m ()
1692+initHold :: SomeHoldInit -> EventM x ()
2308initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
1693initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
2310−initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
1695+{- SPECIALIZE initMerge :: SomeMergeInit -> EventM x () #-}
2311−initDyn (SomeDynInit d) = void $ getDynHold d
1696+--initMerge :: (CanSubscribe x m, Defer SomeMergeUpdate m) => SomeMergeInit -> m ()
1697+initMerge :: SomeMergeInit -> EventM x ()
1698+initMerge (SomeMergeInit subscribed changed) = do
1699+ changeSub <- liftIO $ newSubscriberMergeChange subscribed
1700+ EventSubscription _ changeSubd <- subscribe changed changeSub
1701+ change <- liftIO $ readEventSubscribed changeSubd
1702+ forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1703+ liftIO $ writeIORef (mergeSubscribedChange subscribed) $! (changeSub, changeSubd)
2313−newEventEnv :: IO (EventEnv x)
1705+-- | Run an event action outside of a frame
2314−newEventEnv = do
1706+runFrame :: EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1707+runFrame a = SpiderHost $ ask >>= \spiderEnv -> lift $ do
1708+ -- 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
1709+ pendingCleanups <- atomicModifyIORef (_spiderEnv_cleanups spiderEnv) $ \x -> ([], x)
1710+ {-# SCC "cleanups" #-} sequence_ pendingCleanups
2315 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
1711 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
2316 holdInitRef <- newIORef []
1712 holdInitRef <- newIORef []
2317− dynInitRef <- newIORef []
2318 mergeUpdateRef <- newIORef []
1713 mergeUpdateRef <- newIORef []
2319 mergeInitRef <- newIORef []
1714 mergeInitRef <- newIORef []
2320 heightRef <- newIORef zeroHeight
1715 heightRef <- newIORef zeroHeight
2321 toClearRef <- newIORef []
1716 toClearRef <- newIORef []
2322− toClearIntRef <- newIORef []
2323 toClearRootRef <- newIORef []
1717 toClearRootRef <- newIORef []
2324 coincidenceInfosRef <- newIORef []
1718 coincidenceInfosRef <- newIORef []
2325− delayedRef <- newIORef IntMap.empty
1719+ delayedRef <- liftIO $ newIORef IntMap.empty
2326− return $ EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef
1720+ let env = EventEnv spiderEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef 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)
2346 let go = do
1721 let go = do
2347 result <- a
1722 result <- a
2348− runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
1723+ 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
2349 return result
1724 return result
2350− result <- runEventM go
1725+ result <- runEventM go env
2351− toClear <- readIORef $ eventEnvClears env
1726+ toClear <- readIORef toClearRef
2352− forM_ toClear $ \(Some (Clear ref)) -> {-# SCC "clear" #-} writeIORef ref Nothing
1727+ forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref $! Nothing
2353− toClearInt <- readIORef $ eventEnvIntClears env
2354− forM_ toClearInt $ \(Some (IntClear ref)) -> {-# SCC "intClear" #-} writeIORef ref $! IntMap.empty
2355− toClearRoot <- readIORef $ eventEnvRootClears env
1728+ toClearRoot <- readIORef toClearRootRef
2356− forM_ toClearRoot $ \(Some (RootClear ref)) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1729+ forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
2357− toAssign <- readIORef $ eventEnvAssignments env
1730+ toAssign <- readIORef toAssignRef
2358 toReconnectRef <- newIORef []
1731 toReconnectRef <- newIORef []
2359− coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
1732+ coincidenceInfos <- readIORef coincidenceInfosRef
2360 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
1733 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
2361 writeIORef vRef v
1734 writeIORef vRef v
2362− traceInvalidate $ "Invalidating Hold"
1735+ when debugInvalidate $ putStrLn $ "Invalidating Hold"
2363 writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
1736 writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
2364− mergeUpdates <- readIORef $ eventEnvMergeUpdates env
1737+ mergeUpdates <- readIORef mergeUpdateRef
2365− writeIORef (eventEnvMergeUpdates env) []
1738+ writeIORef mergeUpdateRef $! []
2366− tracePropagate (Proxy::Proxy x) $ "Updating merges"
1739+ let updateMerge :: SomeMergeUpdate -> IO [SomeEventSubscription]
1740+ updateMerge (SomeMergeUpdate (R.PatchDMap p :: R.PatchDMap (DMap k Event)) m) = do
1741+ oldParents <- readIORef $ mergeSubscribedParents m
1742+ let f (subscriptionsToKill, ps) (k :=> Compose me) = do
1743+ (mOldSubd, newPs) <- case me of
1744+ Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1746+ s <- liftIO $ newSubscriberMerge k m
1747+ subscription@(EventSubscription _ subd) <- subscribe e s
1748+ let newParent = MergeSubscribedParent subscription s
1749+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
1750+ liftIO $ addMergeHeight newParentHeight m
1751+ return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1752+ forM_ mOldSubd $ \oldSubd -> do
1753+ oldHeight <- liftIO $ readIORef $ eventSubscribedHeightRef $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1754+ liftIO $ removeMergeHeight oldHeight m
1755+ return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1756+ (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
1757+ writeIORef (mergeSubscribedParents m) $! newParents
1758+ return subscriptionsToKill
1759+ when debugPropagate $ putStrLn "Updating merges"
2367− mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
1760+ mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
2368− tracePropagate (Proxy::Proxy x) $ "Updating merges done"
1761+ when debugPropagate $ putStrLn "Updating merges done"
2369 toReconnect <- readIORef toReconnectRef
1762 toReconnect <- readIORef toReconnectRef
2371 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
1763 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
2372 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
1764 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
2373 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
1765 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2374− traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1766+ when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
2375 finalize wi
1767 finalize wi
2376 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
1768 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
2377 wi' <- mkWeakPtrWithDebug i "wi'"
1769 wi' <- mkWeakPtrWithDebug i "wi'"
2378 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
1770 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
2379− writeIORef (switchSubscribedBehaviorParents subscribed) []
1771+ writeIORef (switchSubscribedBehaviorParents subscribed) $! []
2380− writeIORef (eventEnvHoldInits env) [] --TODO: Should we reuse this?
1772+ writeIORef holdInitRef $! [] --TODO: Should we reuse this?
2381− e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) $ eventEnvHoldInits env
1773+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
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
1774+ 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
2383 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
1775 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
2384 sub <- newSubscriberSwitch subscribed
1776 sub <- newSubscriberSwitch subscribed
2385− subscription <- unSpiderHost $ runFrame $ {-# SCC "subscribeSwitch" #-} subscribe e sub --TODO: Assert that the event isn't firing --TODO: This should not loop because none of the events should be firing, but still, it is inefficient
1777+ subscription <- runReaderT (unSpiderHost (runFrame ({-# SCC "subscribeSwitch" #-} subscribe e sub))) spiderEnv --TODO: Assert that the event isn't firing --TODO: This should not loop because none of the events should be firing, but still, it is inefficient
2387− stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
1779+ stackTrace <- liftIO $ liftM renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1780+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
2389 EventRoot _ -> "EventRoot"
1781 EventRoot _ -> "EventRoot"
2390 EventNever -> "EventNever"
1782 EventNever -> "EventNever"
2391 _ -> "something else"
1783 _ -> "something else"
2393 writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
1785 writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
2394− return oldSubscription
1786+ return $ SomeEventSubscription oldSubscription
2395− liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
1787+ forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
2396− liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
1788+ forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
2397 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
1789 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
2398 EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
1790 EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
2399− parentHeight <- getEventSubscribedHeight subd'
1791+ parentHeight <- readIORef $ eventSubscribedHeightRef subd'
2400 myHeight <- readIORef $ switchSubscribedHeight subscribed
1792 myHeight <- readIORef $ switchSubscribedHeight subscribed
2401 when (parentHeight /= myHeight) $ do
1793 when (parentHeight /= myHeight) $ do
2402 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1794 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
2403− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1795+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1796+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> do
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
1797+ invalidateMergeHeight m --TODO: In addition to when the patch is completely empty, we should also not run this if it has some Nothing values, but none of them have actually had any effect; potentially, we could even check for Just values with no effect (e.g. by comparing their IORefs and ignoring them if they are unchanged); actually, we could just check if the new height is different
2405 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
1798 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
2406 unsubscribe subscription
1799 unsubscribe subscription
2407 mapM_ invalidateCoincidenceHeight mcs
1800 mapM_ invalidateCoincidenceHeight mcs
2408 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
1801 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
2409− mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
1802+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> revalidateMergeHeight m
2410 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
1803 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
2411 height <- calculateSwitchHeight subscribed
1804 height <- calculateSwitchHeight subscribed
2412 updateSwitchHeight height subscribed
1805 updateSwitchHeight height subscribed
@@ -2422,12 +1815,10 @@ zeroHeight = Height 0
2422invalidHeight :: Height
1815invalidHeight :: Height
2423invalidHeight = Height (-1000)
1816invalidHeight = Height (-1000)
2426-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
1818-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
2427{-# INLINE invalidHeightBeingTraversed #-}
1819{-# INLINE invalidHeightBeingTraversed #-}
2428invalidHeightBeingTraversed :: Height
1820invalidHeightBeingTraversed :: Height
2429invalidHeightBeingTraversed = Height (-1001)
1821invalidHeightBeingTraversed = Height (-1001)
2432{-# INLINE succHeight #-}
1823{-# INLINE succHeight #-}
2433succHeight :: Height -> Height
1824succHeight :: Height -> Height
@@ -2436,42 +1827,152 @@ succHeight h@(Height a) =
2436 then invalidHeight
1827 then invalidHeight
2437 else Height $ succ a
1828 else Height $ succ a
1830+invalidateSubscriberHeight :: Height -> Subscriber a -> IO ()
1831+invalidateSubscriberHeight old s = case s of
1832+ SubscriberPush _ subscribed -> do
1833+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1834+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ invalidateSubscriberHeight old
1835+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1836+ SubscriberMerge _ subscribed -> do
1837+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1838+ removeMergeHeight old subscribed
1839+ invalidateMergeHeight subscribed
1840+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1841+ SubscriberMergeChange _ -> return () -- Doesn't affect the height of the merge, because its changes are delayed
1842+ SubscriberFan subscribed -> do
1843+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1844+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1845+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
1846+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1847+ SubscriberHold _ -> return ()
1848+ SubscriberHoldIdentity _ -> return ()
1849+ SubscriberSwitch subscribed -> do
1850+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1851+ oldHeight <- readIORef $ switchSubscribedHeight subscribed
1852+ when (oldHeight /= invalidHeight) $ do
1853+ writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1854+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1855+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1856+ SubscriberCoincidenceOuter subscribed -> do
1857+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1858+ invalidateCoincidenceHeight subscribed
1859+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1860+ SubscriberCoincidenceInner subscribed -> do
1861+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1862+ invalidateCoincidenceHeight subscribed
1863+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1864+ SubscriberHandle -> return ()
1866+removeMergeHeight :: Height -> MergeSubscribed k -> IO ()
1867+removeMergeHeight oldParentHeight subscribed = do
1868+ when debugInvalidateHeight $ putStrLn $ "removeMergeHeight: " <> show oldParentHeight <> " Merge" <> showNodeId subscribed
1869+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1870+ let newHeights = heightBagRemove oldParentHeight oldHeights
1871+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1873+invalidateMergeHeight :: MergeSubscribed k -> IO ()
1874+invalidateMergeHeight subscribed = do
1875+ oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1876+ -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1877+ when (oldHeight /= invalidHeight) $ do
1878+ writeIORef (mergeSubscribedHeight subscribed) $! invalidHeight
1879+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1881+addMergeHeight :: Height -> MergeSubscribed k -> IO ()
1882+addMergeHeight newParentHeight subscribed = do
1883+ when debugInvalidateHeight $ putStrLn $ "addMergeHeight: " <> show newParentHeight <> " Merge" <> showNodeId subscribed
1884+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1885+ let newHeights = heightBagAdd newParentHeight oldHeights
1886+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1888+revalidateMergeHeight :: MergeSubscribed k -> IO ()
1889+revalidateMergeHeight subscribed = do
1890+ currentHeight <- readIORef $ mergeSubscribedHeight subscribed
1891+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1892+ heights <- readIORef $ mergeSubscribedHeightBag subscribed
1893+ parents <- readIORef $ mergeSubscribedParents subscribed
1894+ -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1895+ case heightBagSize heights `compare` DMap.size parents of
1898+ let height = succHeight $ heightBagMax heights
1899+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1900+ writeIORef (mergeSubscribedHeight subscribed) $! height
1901+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1902+ GT -> error $ "revalidateMergeHeight: more heights than parents for Merge" <> showNodeId subscribed
2439−invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1904+invalidateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
2440invalidateCoincidenceHeight subscribed = do
1905invalidateCoincidenceHeight subscribed = do
2441 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
1906 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
2442 when (oldHeight /= invalidHeight) $ do
1907 when (oldHeight /= invalidHeight) $ do
2443 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
1908 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1909+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1911+recalculateSubscriberHeight :: Height -> Subscriber a -> IO ()
1912+recalculateSubscriberHeight new s = case s of
1913+ SubscriberPush _ subscribed -> do
1914+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1915+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1916+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1917+ SubscriberMerge _ subscribed -> do
1918+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1919+ addMergeHeight new subscribed
1920+ revalidateMergeHeight subscribed
1921+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1922+ SubscriberMergeChange _ -> return ()
1923+ SubscriberFan subscribed -> do
1924+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1925+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1926+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
1927+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1928+ SubscriberHold _ -> return ()
1929+ SubscriberHoldIdentity _ -> return ()
1930+ SubscriberSwitch subscribed -> do
1931+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1932+ updateSwitchHeight new subscribed
1933+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1934+ SubscriberCoincidenceOuter subscribed -> do
1935+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1936+ recalculateCoincidenceHeight subscribed
1937+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1938+ SubscriberCoincidenceInner subscribed -> do
1939+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1940+ recalculateCoincidenceHeight subscribed
1941+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1942+ SubscriberHandle -> return ()
2446−updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
1944+updateSwitchHeight :: Height -> SwitchSubscribed a -> IO ()
2447updateSwitchHeight new subscribed = do
1945updateSwitchHeight new subscribed = do
2448 oldHeight <- readIORef $ switchSubscribedHeight subscribed
1946 oldHeight <- readIORef $ switchSubscribedHeight subscribed
2449 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1947 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
2450 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1948 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
2451 writeIORef (switchSubscribedHeight subscribed) $! new
1949 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1950+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
2454−recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1952+recalculateCoincidenceHeight :: CoincidenceSubscribed a -> IO ()
2455recalculateCoincidenceHeight subscribed = do
1953recalculateCoincidenceHeight subscribed = do
2456 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
1954 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
2457 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1955 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
2458 height <- calculateCoincidenceHeight subscribed
1956 height <- calculateCoincidenceHeight subscribed
2459 when (height /= invalidHeight) $ do
1957 when (height /= invalidHeight) $ do
2460 writeIORef (coincidenceSubscribedHeight subscribed) $! height
1958 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1959+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1961+getEventSubscribedHeight :: EventSubscribed a -> IO Height
1962+getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
2463−calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
1964+calculateSwitchHeight :: SwitchSubscribed a -> IO Height
2464−calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
1965+calculateSwitchHeight subscribed = readIORef . eventSubscribedHeightRef . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
2466−calculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO Height
1967+calculateCoincidenceHeight :: CoincidenceSubscribed a -> IO Height
2467calculateCoincidenceHeight subscribed = do
1968calculateCoincidenceHeight subscribed = do
2468− outerHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1969+ outerHeight <- readIORef $ eventSubscribedHeightRef $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
2469− innerHeight <- maybe (return zeroHeight) getEventSubscribedHeight =<< readIORef (coincidenceSubscribedInnerParent subscribed)
1970+ innerHeight <- maybe (return zeroHeight) (readIORef . eventSubscribedHeightRef) =<< readIORef (coincidenceSubscribedInnerParent subscribed)
2470 return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
1971 return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
2472−data SomeSwitchSubscribed x = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed x a)
1973+data SomeSwitchSubscribed = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed a)
2474−invalidate :: IORef [SomeSwitchSubscribed x] -> WeakList (Invalidator x) -> IO (WeakList (Invalidator x))
1975+invalidate :: IORef [SomeSwitchSubscribed] -> WeakList Invalidator -> IO (WeakList Invalidator)
2475invalidate toReconnectRef wis = do
1976invalidate toReconnectRef wis = do
2476 forM_ wis $ \wi -> do
1977 forM_ wis $ \wi -> do
2477 mi <- deRefWeak wi
1978 mi <- deRefWeak wi
@@ -2486,7 +1987,7 @@ invalidate toReconnectRef wis = do
2486 traceInvalidate $ "invalidate: Pull" <> showNodeId p
1987 traceInvalidate $ "invalidate: Pull" <> showNodeId p
2487 mVal <- readIORef $ pullValue p
1988 mVal <- readIORef $ pullValue p
2488 forM_ mVal $ \val -> do
1989 forM_ mVal $ \val -> do
2489− writeIORef (pullValue p) Nothing
1990+ writeIORef (pullValue p) $! Nothing
2490 writeIORef (pullSubscribedInvalidators val) =<< evaluate =<< invalidate toReconnectRef =<< readIORef (pullSubscribedInvalidators val)
1991 writeIORef (pullSubscribedInvalidators val) =<< evaluate =<< invalidate toReconnectRef =<< readIORef (pullSubscribedInvalidators val)
2491 InvalidatorSwitch subscribed -> do
1992 InvalidatorSwitch subscribed -> do
2492 traceInvalidate $ "invalidate: Switch" <> showNodeId subscribed
1993 traceInvalidate $ "invalidate: Switch" <> showNodeId subscribed
@@ -2497,329 +1998,166 @@ invalidate toReconnectRef wis = do
2497-- Reflex integration
1998-- Reflex integration
2498--------------------------------------------------------------------------------
1999--------------------------------------------------------------------------------
2500−-- | Designates the default, global Spider timeline
2501−data SpiderTimeline x
2502−type role SpiderTimeline nominal
2504−-- | The default, global Spider environment
2505−type Spider = SpiderTimeline Global
2001+type Spider = SpiderEnv Global
2507−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
2003+data Global
2508− {-# INLINABLE sample #-}
2509− sample (SpiderBehavior b) = readBehaviorUntracked b
2511−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (EventM x) where
2512− {-# INLINABLE hold #-}
2513− hold = holdSpiderEventM
2514− {-# INLINABLE holdDyn #-}
2515− holdDyn = holdDynSpiderEventM
2516− {-# INLINABLE holdIncremental #-}
2517− holdIncremental = holdIncrementalSpiderEventM
2518− {-# INLINABLE buildDynamic #-}
2519− buildDynamic = buildDynamicSpiderEventM
2520− {-# INLINABLE headE #-}
2521− headE = R.slowHeadE
2522−-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
2523− {-# INLINABLE now #-}
2524− now = nowSpiderEventM
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
2005+{-# NOINLINE globalSpiderEnv #-}
2531− {-# INLINABLE sample #-}
2006+globalSpiderEnv :: SpiderEnv Global
2532− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2007+globalSpiderEnv = unsafePerformIO unsafeNewSpiderEnv
2534−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderPushM x) where
2009+type role SpiderEnv nominal
2535− {-# INLINABLE hold #-}
2010+data SpiderEnv x = SpiderEnv
2536− hold v0 e = Reflex.Class.current <$> Reflex.Class.holdDyn v0 e
2011+ { _spiderEnv_toUnsubscribe :: !(IORef [SomeEventSubscription])
2537− {-# INLINABLE holdDyn #-}
2012+ , _spiderEnv_lock :: !(MVar ())
2538− holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce e
2013+ , _spiderEnv_cleanups :: !(IORef [IO ()])
2539− {-# INLINABLE holdIncremental #-}
2014+#ifdef DEBUG
2540− holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . dynamicHold <$> Reflex.Spider.Internal.hold v0 e
2015+ , _spiderEnv_depth :: !(IORef Int)
2541− {-# INLINABLE buildDynamic #-}
2016+#endif
2542− buildDynamic getV0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce e
2017+ }
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
2019+instance GEq SpiderEnv where
2020+ a `geq` b = if _spiderEnv_toUnsubscribe a == _spiderEnv_toUnsubscribe b
2021+ then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderEnv can't have two different 'x' arguments
2550−instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
2024+unsafeNewSpiderEnv :: forall x. IO (SpiderEnv x)
2551− {-# INLINE return #-}
2025+unsafeNewSpiderEnv = do
2552− return = pure
2026+ toUnsubscribe <- newIORef []
2553− {-# INLINE (>>=) #-}
2027+ lock <- newMVar ()
2554− x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
2028+ cleanups <- newIORef []
2555− {-# INLINE (>>) #-}
2029+#ifdef DEBUG
2556− (>>) = (*>)
2030+ depthRef <- newIORef 0
2557−#if !MIN_VERSION_base(4,13,0)
2558− {-# INLINE fail #-}
2559− fail _ = error "Dynamic does not support 'fail'"
2561−
2032+ return $ SpiderEnv
2562−{-# INLINABLE newJoinDyn #-}
2033+ { _spiderEnv_toUnsubscribe = toUnsubscribe
2563−newJoinDyn :: HasSpiderTimeline x => DynamicS x (Identity (DynamicS x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
2034+ , _spiderEnv_lock = lock
2564−newJoinDyn d =
2035+ , _spiderEnv_cleanups = cleanups
2565− let readV0 = readBehaviorTracked . dynamicCurrent =<< readBehaviorTracked (dynamicCurrent d)
2036+#ifdef DEBUG
2566− eOuter = Reflex.Spider.Internal.push (fmap (Just . Identity) . readBehaviorUntracked . dynamicCurrent . runIdentity) $ dynamicUpdated d
2037+ , _spiderEnv_depth = depthRef
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
2039+ }
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
2589−holdSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Behavior (SpiderTimeline x) a)
2041+newSpiderEnv :: IO (Some SpiderEnv)
2590−holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2042+newSpiderEnv = Some.This <$> unsafeNewSpiderEnv
2592−holdDynSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2044+newtype SpiderPullM x a = SpiderPullM { runSpiderPullM :: BehaviorM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2593−holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2595−holdIncrementalSpiderEventM :: (HasSpiderTimeline x, Patch p) => PatchTarget p -> Reflex.Class.Event (SpiderTimeline x) p -> EventM x (Reflex.Class.Incremental (SpiderTimeline x) p)
2046+newtype SpiderPushM x a = SpiderPushM { runSpiderPushM :: ComputeM a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2596−holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2047+
2048+instance R.Reflex (SpiderEnv x) where
2049+ newtype Behavior (SpiderEnv x) a = SpiderBehavior { unSpiderBehavior :: Behavior a }
2050+ newtype Event (SpiderEnv x) a = SpiderEvent { unSpiderEvent :: Event a }
2051+ newtype Dynamic (SpiderEnv x) a = SpiderDynamic { unSpiderDynamic :: Dynamic Identity a } deriving (Functor, Applicative, Monad)
2052+ newtype Incremental (SpiderEnv x) p a = SpiderIncremental { unSpiderIncremental :: Dynamic p a }
2053+ type PullM (SpiderEnv x) = SpiderPullM x
2054+ type PushM (SpiderEnv x) = SpiderPushM x
2055+ {-# INLINABLE never #-}
2056+ never = SpiderEvent EventNever
2057+ {-# INLINABLE constant #-}
2058+ constant = SpiderBehavior . BehaviorConst
2059+ {-# INLINABLE push #-}
2060+ push f = SpiderEvent . push (coerce f) . unSpiderEvent
2061+ {-# INLINABLE pull #-}
2062+ pull = SpiderBehavior . pull . coerce
2063+ {-# INLINABLE merge #-}
2064+ merge = SpiderEvent . merge . DynamicConst . (unsafeCoerce :: DMap k (R.Event (SpiderEnv x)) -> DMap k Event)
2065+ {-# INLINABLE fan #-}
2066+ fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
2067+ {-# INLINABLE switch #-}
2068+ switch = SpiderEvent . switch . (unsafeCoerce :: Behavior (R.Event (SpiderEnv x) a) -> Behavior (Event a)) . unSpiderBehavior
2069+ {-# INLINABLE coincidence #-}
2070+ coincidence = SpiderEvent . coincidence . (unsafeCoerce :: Event (R.Event (SpiderEnv x) a) -> Event (Event a)) . unSpiderEvent
2071+ {-# INLINABLE current #-}
2072+ current = SpiderBehavior . current . unSpiderDynamic
2073+ {-# INLINABLE updated #-}
2074+ updated = SpiderEvent . fmap runIdentity . updated . unSpiderDynamic
2075+ {-# INLINABLE unsafeBuildDynamic #-}
2076+ unsafeBuildDynamic readV0 v' = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (coerce readV0) $ addIdentity $ unSpiderEvent v'
2077+ {-# INLINABLE unsafeBuildIncremental #-}
2078+ unsafeBuildIncremental readV0 dv = SpiderIncremental $ DynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
2079+ {-# INLINABLE mergeIncremental #-}
2080+ mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic R.PatchDMap (DMap k (R.Event (SpiderEnv x))) -> Dynamic R.PatchDMap (DMap k Event)) . unSpiderIncremental
2081+ {-# INLINABLE currentIncremental #-}
2082+ currentIncremental = SpiderBehavior . current . unSpiderIncremental
2083+ {-# INLINABLE updatedIncremental #-}
2084+ updatedIncremental = SpiderEvent . updated . unSpiderIncremental
2085+ {-# INLINABLE incrementalToDynamic #-}
2086+ incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ current i) $ flip push (updated i) $ \p -> do
2087+ c <- readBehaviorUntracked $ current i
2088+ return $ fmap Identity $ R.apply p c --TODO: Avoid the redundant 'apply'
2598−buildDynamicSpiderEventM :: HasSpiderTimeline x => SpiderPushM x a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2090+instance R.MonadSample (SpiderEnv x) (EventM x) where
2599−buildDynamicSpiderEventM getV0 e = fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
2091+ {-# INLINABLE sample #-}
2092+ sample (SpiderBehavior b) = readBehaviorUntracked b
2601−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
2094+instance R.MonadHold (SpiderEnv x) (EventM x) where
2602 {-# INLINABLE hold #-}
2095 {-# INLINABLE hold #-}
2603− hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
2096+ hold = holdSpiderEventM
2604 {-# INLINABLE holdDyn #-}
2097 {-# INLINABLE holdDyn #-}
2605− holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
2098+ holdDyn = holdDynSpiderEventM
2606 {-# INLINABLE holdIncremental #-}
2099 {-# INLINABLE holdIncremental #-}
2607− holdIncremental v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdIncremental v0 e
2100+ holdIncremental = holdIncrementalSpiderEventM
2608− {-# INLINABLE buildDynamic #-}
2101+
2609− buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
2102+holdSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Behavior (SpiderEnv x) a)
2610− {-# INLINABLE headE #-}
2103+holdSpiderEventM v0 e = liftM (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
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
2619−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2105+holdDynSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Dynamic (SpiderEnv x) a)
2106+holdDynSpiderEventM v0 e = liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2108+holdIncrementalSpiderEventM :: R.Patch p => a -> R.Event (SpiderEnv x) (p a) -> EventM x (R.Incremental (SpiderEnv x) p a)
2109+holdIncrementalSpiderEventM v0 e = liftM (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2111+instance R.MonadHold (SpiderEnv x) (SpiderHost x) where
2620 {-# INLINABLE hold #-}
2112 {-# INLINABLE hold #-}
2621− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2113+ hold v0 e = R.runHostFrame $ R.hold v0 e
2622 {-# INLINABLE holdDyn #-}
2114 {-# INLINABLE holdDyn #-}
2623− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2115+ holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
2624 {-# INLINABLE holdIncremental #-}
2116 {-# INLINABLE holdIncremental #-}
2625− holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2117+ holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
2626− {-# INLINABLE buildDynamic #-}
2118+
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
2119+instance R.MonadSample (SpiderEnv x) (SpiderHost x) where
2635 {-# INLINABLE sample #-}
2120 {-# INLINABLE sample #-}
2636 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
2121 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
2638−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2123+instance R.MonadSample (SpiderEnv x) (SpiderPullM x) where
2124+ {-# INLINABLE sample #-}
2125+ sample = coerce . readBehaviorTracked . unSpiderBehavior
2127+instance R.MonadSample (SpiderEnv x) (SpiderPushM x) where
2639 {-# INLINABLE sample #-}
2128 {-# INLINABLE sample #-}
2640− sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
2129+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2642−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2131+instance R.MonadHold (SpiderEnv x) (SpiderPushM x) where
2643 {-# INLINABLE hold #-}
2132 {-# INLINABLE hold #-}
2644− hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
2133+ hold v0 e = R.current <$> R.holdDyn v0 e
2645 {-# INLINABLE holdDyn #-}
2134 {-# INLINABLE holdDyn #-}
2646− holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
2135+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity e
2647 {-# INLINABLE holdIncremental #-}
2136 {-# INLINABLE holdIncremental #-}
2648− holdIncremental v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdIncremental v0 e
2137+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ liftM (SpiderIncremental . DynamicHold) $ hold 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
2656−--------------------------------------------------------------------------------
2139+data RootTrigger a = forall k. GCompare k => RootTrigger (SubscriberList a, IORef (DMap k Identity), k a)
2657−-- Deprecated items
2140+newtype SpiderEventHandle a = SpiderEventHandle { unSpiderEventHandle :: EventSubscription a }
2658−--------------------------------------------------------------------------------
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
2142+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHostFrame x) where
2664 {-# INLINABLE subscribeEvent #-}
2143 {-# INLINABLE subscribeEvent #-}
2665 subscribeEvent e = SpiderHostFrame $ do
2144 subscribeEvent e = SpiderHostFrame $ do
2666− --TODO: Unsubscribe eventually (manually and/or with weak ref)
2145+ subscription <- subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2667− val <- liftIO $ newIORef Nothing
2668− subscription <- subscribe (unSpiderEvent e) $ Subscriber
2669− { subscriberPropagate = \a -> do
2670− liftIO $ writeIORef val $ Just a
2672− , subscriberInvalidateHeight = \_ -> return ()
2673− , subscriberRecalculateHeight = \_ -> return ()
2675− return $ SpiderEventHandle
2146+ return $ SpiderEventHandle subscription
2676− { spiderEventHandleSubscription = subscription
2147+
2677− , spiderEventHandleValue = val
2680−instance HasSpiderTimeline x => Reflex.Host.Class.ReflexHost (SpiderTimeline x) where
2148+instance R.ReflexHost (SpiderEnv x) where
2681− type EventTrigger (SpiderTimeline x) = RootTrigger x
2149+ type EventTrigger (SpiderEnv x) = RootTrigger
2682− type EventHandle (SpiderTimeline x) = SpiderEventHandle x
2150+ type EventHandle (SpiderEnv x) = SpiderEventHandle
2683− type HostFrame (SpiderTimeline x) = SpiderHostFrame x
2151+ type HostFrame (SpiderEnv x) = SpiderHostFrame x
2685−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2153+instance R.MonadReadEvent (SpiderEnv x) (ReadPhase x) where
2686− {-# NOINLINE readEvent #-}
2154+ {-# INLINABLE readEvent #-}
2687− readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
2155+ readEvent h = ReadPhase $ liftM (fmap return) $ liftIO $ do
2688− result <- readIORef $ spiderEventHandleValue h
2156+ let EventSubscription sln subscribed = unSpiderEventHandle h
2157+ result <- readEventSubscribed subscribed
2689− touch h
2158+ touch sln
2690 return result
2159 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)
2823instance MonadRef (EventM x) where
2161instance MonadRef (EventM x) where
2824 type Ref (EventM x) = Ref IO
2162 type Ref (EventM x) = Ref IO
2825 {-# INLINABLE newRef #-}
2163 {-# INLINABLE newRef #-}
@@ -2833,8 +2171,7 @@ instance MonadAtomicRef (EventM x) where
2833 {-# INLINABLE atomicModifyRef #-}
2171 {-# INLINABLE atomicModifyRef #-}
2834 atomicModifyRef r f = liftIO $ atomicModifyRef r f
2172 atomicModifyRef r f = liftIO $ atomicModifyRef r f
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)
2174+newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2839instance Monad (SpiderHost x) where
2176instance Monad (SpiderHost x) where
2840 {-# INLINABLE (>>=) #-}
2177 {-# INLINABLE (>>=) #-}
@@ -2843,27 +2180,13 @@ instance Monad (SpiderHost x) where
2843 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
2180 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
2844 {-# INLINABLE return #-}
2181 {-# INLINABLE return #-}
2845 return x = SpiderHost $ return x
2182 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
2852 {-# INLINABLE fail #-}
2183 {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2184+ fail s = SpiderHost $ fail s
2855−-- | Run an action affecting the global Spider timeline; this will be guarded by
2856−-- a mutex for that timeline
2857runSpiderHost :: SpiderHost Global a -> IO a
2186runSpiderHost :: SpiderHost Global a -> IO a
2858−runSpiderHost (SpiderHost a) = a
2187+runSpiderHost (SpiderHost a) = runReaderT a globalSpiderEnv
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
2865−newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866− deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2189+newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2868instance Monad (SpiderHostFrame x) where
2191instance Monad (SpiderHostFrame x) where
2869 {-# INLINABLE (>>=) #-}
2192 {-# INLINABLE (>>=) #-}
@@ -2872,21 +2195,30 @@ instance Monad (SpiderHostFrame x) where
2872 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
2195 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
2873 {-# INLINABLE return #-}
2196 {-# INLINABLE return #-}
2874 return x = SpiderHostFrame $ return x
2197 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
2876 {-# INLINABLE fail #-}
2198 {-# INLINABLE fail #-}
2877 fail s = SpiderHostFrame $ fail s
2199 fail s = SpiderHostFrame $ fail s
2880−instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2201+instance R.MonadSample (SpiderEnv x) (SpiderHostFrame x) where
2881− notReadyUntil _ = pure ()
2202+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2882− notReady = pure ()
2203+
2204+addIdentity :: Event a -> Event (Identity a)
2205+--addIdentity = fmap Identity
2206+addIdentity = unsafeCoerce
2208+instance R.MonadHold (SpiderEnv x) (SpiderHostFrame x) where
2209+ {-# INLINABLE hold #-}
2210+ hold v0 e = SpiderHostFrame $ liftM (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2211+ {-# INLINABLE holdDyn #-}
2212+ holdDyn v0 e = SpiderHostFrame $ liftM (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2213+ {-# INLINABLE holdIncremental #-}
2214+ holdIncremental v0 e = SpiderHostFrame $ liftM (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2884−newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2216+newEventWithTriggerIO :: forall a. (RootTrigger a -> IO (IO ())) -> IO (Event a)
2885newEventWithTriggerIO f = do
2217newEventWithTriggerIO f = do
2886 es <- newFanEventWithTriggerIO $ \Refl -> f
2218 es <- newFanEventWithTriggerIO $ \Refl -> f
2887 return $ select es Refl
2219 return $ select es Refl
2889−newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2221+newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger a -> IO (IO ())) -> IO (EventSelector k)
2890newFanEventWithTriggerIO f = do
2222newFanEventWithTriggerIO f = do
2891 occRef <- newIORef DMap.empty
2223 occRef <- newIORef DMap.empty
2892 subscribedRef <- newIORef DMap.empty
2224 subscribedRef <- newIORef DMap.empty
@@ -2895,9 +2227,47 @@ newFanEventWithTriggerIO f = do
2895 , rootSubscribed = subscribedRef
2227 , rootSubscribed = subscribedRef
2896 , rootInit = f
2228 , rootInit = f
2898− return $ EventSelector $ \k -> eventRoot k r
2230+ return $ EventSelector $ \k -> EventRoot k r
2232+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHost x) where
2233+ newEventWithTrigger = SpiderHost . lift . liftM SpiderEvent . newEventWithTriggerIO
2234+ newFanEventWithTrigger f = SpiderHost $ lift $ do
2235+ es <- newFanEventWithTriggerIO f
2236+ return $ R.EventSelector $ SpiderEvent . select es
2238+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHostFrame x) where
2239+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . liftM SpiderEvent . newEventWithTriggerIO
2240+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2241+ es <- newFanEventWithTriggerIO f
2242+ return $ R.EventSelector $ SpiderEvent . select es
2244+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHost x) where
2245+ {-# INLINABLE subscribeEvent #-}
2246+ subscribeEvent = subscribeEventSpiderHost
2248+subscribeEventSpiderHost :: R.Event (SpiderEnv x) a -> SpiderHost x (R.EventHandle (SpiderEnv x) a)
2249+subscribeEventSpiderHost e = do
2250+ subscription <- runFrame $ subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2251+ return $ SpiderEventHandle subscription
2253+newtype ReadPhase x a = ReadPhase { runReadPhase :: ResultM x a } deriving (Functor, Applicative, Monad, MonadFix)
2255+instance R.MonadSample (SpiderEnv x) (ReadPhase x) where
2256+ {-# INLINABLE sample #-}
2257+ sample = ReadPhase . R.sample
2900−newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
2259+instance R.MonadHold (SpiderEnv x) (ReadPhase x) where
2260+ {-# INLINABLE hold #-}
2261+ hold v0 e = ReadPhase $ R.hold v0 e
2262+ {-# INLINABLE holdDyn #-}
2263+ holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2264+ {-# INLINABLE holdIncremental #-}
2265+ holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2267+instance R.MonadReflexHost (SpiderEnv x) (SpiderHost x) where
2268+ type ReadPhase (SpiderHost x) = ReadPhase x
2269+ fireEventsAndRead es (ReadPhase a) = run es a
2270+ runHostFrame = runFrame . runSpiderHostFrame
2902instance MonadRef (SpiderHost x) where
2272instance MonadRef (SpiderHost x) where
2903 type Ref (SpiderHost x) = Ref IO
2273 type Ref (SpiderHost x) = Ref IO
@@ -2916,15 +2286,3 @@ instance MonadRef (SpiderHostFrame x) where
2917instance MonadAtomicRef (SpiderHostFrame x) where
2287instance MonadAtomicRef (SpiderHostFrame x) where
2918 atomicModifyRef r = SpiderHostFrame . atomicModifyRef r
2288 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 ()