@@ -9,75 +9,125 @@
99{-# LANGUAGE GADTs #-}
1010{-# LANGUAGE GeneralizedNewtypeDeriving #-}
1111{-# LANGUAGE LambdaCase #-}
12−{-# LANGUAGE MagicHash #-}
13−{-# LANGUAGE MultiParamTypeClasses #-}
14−{-# LANGUAGE MultiWayIf #-}
1512{-# LANGUAGE RankNTypes #-}
1613{-# LANGUAGE RoleAnnotations #-}
1714{-# LANGUAGE ScopedTypeVariables #-}
1815{-# LANGUAGE TypeFamilies #-}
1916{-# LANGUAGE TypeOperators #-}
2017{-# LANGUAGE UndecidableInstances #-}
18+{-# LANGUAGE PolyKinds #-}
19+{-# LANGUAGE DeriveFunctor #-}
20+{-# LANGUAGE StandaloneDeriving #-}
21+{-# LANGUAGE InstanceSigs #-}
22+{-# LANGUAGE MultiWayIf #-}
23+
24+#ifdef USE_REFLEX_OPTIMIZER
25+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
26+#endif
27+{-# OPTIONS_GHC -Wunused-binds #-}
2128-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
2229-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
23−module Reflex.Spider.Internal
24− ( Spider
25− , SpiderEnv (..)
26− , Global
27− , SpiderHost
28− , runSpiderHost
29− , newSpiderEnv
30− , askSpiderEnv
31− ) where
32−
33−import Control.Applicative
30+module Reflex.Spider.Internal (module Reflex.Spider.Internal) where
31+
32+#if MIN_VERSION_base(4,10,0)
33+import Control.Applicative (liftA2)
34+#endif
3435import Control.Concurrent
3536import Control.Exception
36−import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
37+import Control.Monad hiding (forM, forM_, mapM, mapM_)
3738import Control.Monad.Exception
38−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
39+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
3940import Control.Monad.Primitive
40−import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
41+import Control.Monad.Reader.Class
42+import Control.Monad.IO.Class
43+import Control.Monad.ReaderIO
4144import Control.Monad.Ref
42−import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
45+import Control.Monad.Fail (MonadFail)
46+import qualified Control.Monad.Fail as MonadFail
4347import Data.Align
4448import Data.Coerce
45−import Data.Dependent.Map (DMap, DSum (..))
49+import Data.Dependent.Map (DMap)
4650import qualified Data.Dependent.Map as DMap
51+import Data.Dependent.Sum (DSum (..))
52+import Data.FastMutableIntMap (FastMutableIntMap, PatchIntMap (..))
53+import qualified Data.FastMutableIntMap as FastMutableIntMap
4754import Data.Foldable hiding (concat, elem, sequence_)
48−import Data.Function
49−import Data.Functor.Compose
55+import Data.Functor.Constant
56+import Data.Functor.Misc
57+import Data.Functor.Product
5058import Data.GADT.Compare
5159import Data.IntMap.Strict (IntMap)
5260import qualified Data.IntMap.Strict as IntMap
5361import Data.IORef
54−import Data.List hiding (foldl')
55−import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
56−import qualified Data.List.NonEmpty as NonEmpty
57−import Data.Maybe
62+import Data.Kind (Type)
63+import Data.Maybe hiding (mapMaybe)
5864import Data.Monoid (mempty, (<>))
59−import Data.Some (Some)
60−import qualified Data.Some as Some
65+import Data.Proxy
6166import Data.These
6267import Data.Traversable
63−import Data.Tree (Forest, Tree (..), drawForest)
64−import Data.Word
68+import Data.Type.Equality ((:~:)(Refl))
69+import Data.Witherable (Filterable, mapMaybe)
70+import GHC.Exts hiding (toList)
6571import GHC.IORef (IORef (..))
6672import GHC.Stack
73+import Reflex.FastWeak
6774import System.IO.Unsafe
6875import System.Mem.Weak
6976import Unsafe.Coerce
7077
71−import Data.WeakBag (WeakBag, WeakBagTicket)
78+#ifdef MIN_VERSION_semialign
79+#if MIN_VERSION_these(0,8,0)
80+import Data.These.Combinators (justThese)
81+#endif
82+#if MIN_VERSION_semialign(1,1,0)
83+import Data.Zip (Zip (..))
84+#endif
85+#endif
86+
87+#ifdef DEBUG_CYCLES
88+import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89+#endif
90+
91+import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
92+import qualified Data.List.NonEmpty as NonEmpty
93+import Data.Tree (Forest, Tree (..), drawForest)
94+import Data.List (isPrefixOf)
95+
96+import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
97+import qualified Data.FastWeakBag as FastWeakBag
98+
99+import Data.Reflection
100+import Data.Some (Some(Some))
101+import Data.Type.Coercion
102+import Data.Profunctor.Unsafe ((#.), (.#))
103+import Data.WeakBag (WeakBag, WeakBagTicket, _weakBag_children)
72104import qualified Data.WeakBag as WeakBag
105+import qualified Reflex.Class
73106import qualified Reflex.Class as R
74−import qualified Reflex.Host.Class as R
107+import qualified Reflex.Host.Class
108+import Reflex.NotReady.Class
109+import Data.Patch
110+import qualified Data.Patch.DMapWithMove as PatchDMapWithMove
111+import Reflex.PerformEvent.Base (PerformEventT)
112+
113+#ifdef DEBUG_TRACE_EVENTS
114+import qualified Data.ByteString.Char8 as BS8
115+import System.IO (stderr)
116+import Data.List (isPrefixOf)
117+#endif
75118
76−-- Note: must come last to silence warnings due to AMP on GHC < 7.10
77−import Prelude hiding (any, concat, mapM, mapM_, sequence)
119+-- TODO stdout might not be the best channel for debug output
120+debugStrLn :: String -> IO ()
121+debugStrLn = putStrLn
78122
79−type SubscriberList x a = WeakBag (Subscriber x a)
80−type SubscriberListTicket x a = WeakBagTicket (Subscriber x a)
123+#ifdef DEBUG_TRACE_EVENTS
124+withStackOneLine :: (BS8.ByteString -> a) -> a
125+withStackOneLine expr = unsafePerformIO $ do
126+ stack <- currentCallStack
127+ return (expr . BS8.pack . unwords . dropInternal . reverse $ stack)
128+ where dropInternal = filterStack "Reflex.Spider.Internal"
129+
130+#endif
81131
82132debugPropagate :: Bool
83133
@@ -86,31 +136,42 @@ debugInvalidateHeight :: Bool
86136debugInvalidate :: Bool
87137
88138#ifdef DEBUG
89−
90139#define DEBUG_NODEIDS
91140
141+#ifdef DEBUG_TRACE_PROPAGATION
92142debugPropagate = True
143+#else
144+debugPropagate = False
145+#endif
93146
147+#ifdef DEBUG_TRACE_HEIGHT
148+debugInvalidateHeight = True
149+#else
94150debugInvalidateHeight = False
151+#endif
95152
153+#ifdef DEBUG_TRACE_INVALIDATION
96154debugInvalidate = True
155+#else
156+debugInvalidate = False
157+#endif
97158
98159class HasNodeId a where
99160 getNodeId :: a -> Int
100161
101−instance HasNodeId (Hold x p a) where
102− getNodeId = holdNodeId
162+instance HasNodeId (CacheSubscribed x a) where
163+ getNodeId = _cacheSubscribed_nodeId
164+
165+instance HasNodeId (FanInt x a) where
166+ getNodeId = _fanInt_nodeId
103167
104−instance HasNodeId (PushSubscribed x a b) where
105− getNodeId = pushSubscribedNodeId
168+instance HasNodeId (Hold x p) where
169+ getNodeId = holdNodeId
106170
107171instance HasNodeId (SwitchSubscribed x a) where
108172 getNodeId = switchSubscribedNodeId
109173
110−instance HasNodeId (MergeSubscribed x a) where
111− getNodeId = mergeSubscribedNodeId
112−
113−instance HasNodeId (FanSubscribed x a) where
174+instance HasNodeId (FanSubscribed x v a) where
114175 getNodeId = fanSubscribedNodeId
115176
116177instance HasNodeId (CoincidenceSubscribed x a) where
@@ -124,41 +185,16 @@ instance HasNodeId (Pull x a) where
124185
125186{-# INLINE showNodeId #-}
126187showNodeId :: HasNodeId a => a -> String
127−showNodeId = ("#"<>) . show . getNodeId
128−
129−showSubscriberType :: Subscriber x a -> String
130−showSubscriberType = \case
131− SubscriberPush _ _ -> "SubscriberPush"
132− SubscriberMerge _ _ -> "SubscriberMerge"
133− SubscriberFan _ -> "SubscriberFan"
134− SubscriberMergeChange _ -> "SubscriberMergeChange"
135− SubscriberHold _ -> "SubscriberHold"
136− SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
137− SubscriberSwitch _ -> "SubscriberSwitch"
138− SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
139− SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
140− SubscriberHandle -> "SubscriberHandle"
141−
142−showEventType :: Event x a -> String
143−showEventType = \case
144− EventRoot _ _ -> "EventRoot"
145− EventNever -> "EventNever"
146− EventPush _ -> "EventPush"
147− EventMerge _ -> "EventMerge"
148− EventFan _ _ -> "EventFan"
149− EventSwitch _ -> "EventSwitch"
150− EventCoincidence _ -> "EventCoincidence"
151− EventHold _ -> "EventHold"
152− EventDyn _ -> "EventDyn"
153− EventHoldIdentity _ -> "EventHoldIdentity"
154− EventDynIdentity _ -> "EventDynIdentity"
188+showNodeId = showNodeId' . getNodeId
189+
190+showNodeId' :: Int -> String
191+showNodeId' = ("#"<>) . show
192+
155193
156194#else
157195
158196debugPropagate = False
159−
160197debugInvalidateHeight = False
161−
162198debugInvalidate = False
163199
164200-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -166,6 +202,10 @@ debugInvalidate = False
166202showNodeId :: a -> String
167203showNodeId _ = ""
168204
205+{-# INLINE showNodeId' #-}
206+showNodeId' :: Int -> String
207+showNodeId' _ = ""
208+
169209#endif
170210
171211#ifdef DEBUG_NODEIDS
@@ -175,227 +215,637 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
175215
176216newNodeId :: IO Int
177217newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
178−
179−{-# NOINLINE unsafeNodeId #-}
180−unsafeNodeId :: a -> Int
181−unsafeNodeId a = unsafePerformIO $ do
182− touch a
183− newNodeId
184218#endif
185219
220+--------------------------------------------------------------------------------
221+-- EventSubscription
222+--------------------------------------------------------------------------------
223+
224+--NB: Once you subscribe to an Event, you must always hold on the the WHOLE EventSubscription you get back
225+-- If you do not retain the subscription, you may be prematurely unsubscribed from the parent event.
226+data EventSubscription x = EventSubscription
227+ { _eventSubscription_unsubscribe :: !(IO ())
228+ , _eventSubscription_subscribed :: {-# UNPACK #-} !(EventSubscribed x)
229+ }
230+
231+unsubscribe :: EventSubscription x -> IO ()
232+unsubscribe (EventSubscription u _) = u
233+
186234--------------------------------------------------------------------------------
187235-- Event
188236--------------------------------------------------------------------------------
189237
190−newtype Event x a = Event { subscribe :: Subscriber x a -> EventM x (EventSubscription x a) }
238+newtype Event x a = Event { unEvent :: Subscriber x a -> EventM x (EventSubscription x, Maybe a) }
191239
192−wrap :: Monad m => (t -> EventSubscribed x a) -> (Subscriber x a -> m (SubscriberListTicket x a, t)) -> Subscriber x a -> m (EventSubscription x a)
193−wrap tag getSpecificSubscribed sub = do
194− (sln, subd) <- getSpecificSubscribed sub
195− return $ EventSubscription (Just sln) $ tag subd
240+{-# INLINE subscribeAndRead #-}
241+subscribeAndRead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
242+subscribeAndRead = unEvent
196243
197−eventRoot :: GCompare k => k a -> Root x k -> Event x a
198−eventRoot !k !r = Event $ wrap EventSubscribedRoot $ liftIO . getRootSubscribed k r
244+{-# RULES
245+"cacheEvent/cacheEvent" forall e. cacheEvent (cacheEvent e) = cacheEvent e
246+"cacheEvent/pushCheap" forall f e. pushCheap f (cacheEvent e) = cacheEvent (pushCheap f e)
247+"hold/cacheEvent" forall f e. hold f (cacheEvent e) = hold f e
248+ #-}
199249
200−eventNever :: Event x a
201−eventNever = Event $ \_ -> return $ EventSubscription Nothing EventSubscribedNever
250+-- | Construct an 'Event' equivalent to that constructed by 'push', but with no
251+-- caching; if the computation function is very cheap, this is (much) more
252+-- efficient than 'push'
253+{-# INLINE [1] pushCheap #-}
254+pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
255+pushCheap !f e = Event $ \sub -> do
256+ (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "push" $ sub
257+ { subscriberPropagate = \a -> do
258+ mb <- f a
259+ mapM_ (subscriberPropagate sub) mb
260+ }
261+ occ' <- join <$> mapM f occ
262+ return (subscription, occ')
263+
264+-- | A subscriber that never triggers other 'Event's
265+{-# INLINE terminalSubscriber #-}
266+terminalSubscriber :: (a -> EventM x ()) -> Subscriber x a
267+terminalSubscriber p = Subscriber
268+ { subscriberPropagate = p
269+ , subscriberInvalidateHeight = \_ -> return ()
270+ , subscriberRecalculateHeight = \_ -> return ()
271+ }
202272
203−eventPush :: Push x b a -> Event x a
204−eventPush !p = Event $ wrap EventSubscribedPush $ getPushSubscribed p
273+-- | Subscribe to an Event only for the duration of one occurrence
274+{-# INLINE subscribeAndReadHead #-}
275+subscribeAndReadHead :: HasSpiderTimeline x => Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
276+subscribeAndReadHead e sub = do
277+ subscriptionRef <- liftIO $ newIORef $ error "subscribeAndReadHead: not initialized"
278+ (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "head" $ sub
279+ { subscriberPropagate = \a -> do
280+ liftIO $ unsubscribe =<< readIORef subscriptionRef
281+ subscriberPropagate sub a
282+ }
283+ liftIO $ case occ of
284+ Nothing -> writeIORef subscriptionRef $! subscription
285+ Just _ -> unsubscribe subscription
286+ return (subscription, occ)
287+
288+--TODO: Make this lazy in its input event
289+headE :: (MonadIO m, Defer (SomeMergeInit x) m, HasSpiderTimeline x) => Event x a -> m (Event x a)
290+headE originalE = do
291+ parent <- liftIO $ newIORef $ Just originalE
292+ defer $ SomeMergeInit $ do --TODO: Rename SomeMergeInit appropriately
293+ let clearParent = liftIO $ writeIORef parent Nothing
294+ (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ const clearParent
295+ when (isJust occ) clearParent
296+ return $ Event $ \sub ->
297+ liftIO (readIORef parent) >>= \case
298+ Nothing -> subscribeAndReadNever
299+ Just e -> subscribeAndReadHead e sub
300+
301+data CacheSubscribed x a
302+ = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(FastWeakBag (Subscriber x a))
303+ , _cacheSubscribed_parent :: {-# UNPACK #-} !(EventSubscription x)
304+ , _cacheSubscribed_occurrence :: {-# UNPACK #-} !(IORef (Maybe a))
305+#ifdef DEBUG_NODEIDS
306+ , _cacheSubscribed_nodeId :: {-# UNPACK #-} !Int
307+#endif
308+ }
205309
206−eventMerge :: (GCompare k, a ~ DMap k Identity) => Merge x k -> Event x a
207−eventMerge !m = Event $ wrap EventSubscribedMerge $ getMergeSubscribed m
310+nowSpiderEventM :: (HasSpiderTimeline x) => EventM x (R.Event (SpiderTimeline x) ())
311+nowSpiderEventM =
312+ SpiderEvent <$> now
313+
314+now :: (MonadIO m, Defer (Some Clear) m, HasSpiderTimeline x
315+ ) => m (Event x ())
316+now = do
317+ nowOrNot <- liftIO $ newIORef $ Just ()
318+ scheduleClear nowOrNot
319+ return . Event $ \_ -> do
320+ occ <- liftIO . readIORef $ nowOrNot
321+ return ( EventSubscription (return ()) eventSubscribedNow
322+ , occ
323+ )
324+
325+-- | Construct an 'Event' whose value is guaranteed not to be recomputed
326+-- repeatedly
327+--
328+--TODO: Try a caching strategy where we subscribe directly to the parent when
329+--there's only one subscriber, and then build our own FastWeakBag only when a second
330+--subscriber joins
331+{-# NOINLINE [0] cacheEvent #-}
332+cacheEvent :: forall x a. HasSpiderTimeline x => Event x a -> Event x a
333+cacheEvent e =
334+#ifdef DEBUG_TRACE_EVENTS
335+ withStackOneLine $ \callSite -> Event $
336+#else
337+ Event $
338+#endif
339+ unsafePerformIO $ do
340+ mSubscribedRef :: IORef (FastWeak (CacheSubscribed x a))
341+ <- newIORef emptyFastWeak
342+ pure $ \sub -> {-# SCC "cacheEvent" #-} do
343+#ifdef DEBUG_TRACE_EVENTS
344+ unless (BS8.null callSite) $ liftIO $ BS8.hPutStrLn stderr callSite
345+#endif
346+ subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347+ Just subscribedTicket -> return subscribedTicket
348+ Nothing -> do
349+#ifdef DEBUG_NODEIDS
350+ nodeId <- liftIO newNodeId
351+#endif
352+ subscribers <- liftIO FastWeakBag.empty
353+ occRef <- liftIO $ newIORef Nothing -- This should never be read prior to being set below
354+#ifdef DEBUG_NODEIDS
355+ (parentSub, occ) <- subscribeAndRead e $ debugSubscriber' ("cacheEvent" <> showNodeId' nodeId) $ Subscriber
356+#else
357+ (parentSub, occ) <- subscribeAndRead e $ Subscriber
358+#endif
359+ { subscriberPropagate = \a -> do
360+ liftIO $ writeIORef occRef (Just a)
361+ scheduleClear occRef
362+ propagateFast a subscribers
363+ , subscriberInvalidateHeight = FastWeakBag.traverse_ subscribers . invalidateSubscriberHeight
364+ , subscriberRecalculateHeight = FastWeakBag.traverse_ subscribers . recalculateSubscriberHeight
365+ }
366+ when (isJust occ) $ do
367+ liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368+ scheduleClear occRef
369+ let !subscribed = CacheSubscribed
370+ { _cacheSubscribed_subscribers = subscribers
371+ , _cacheSubscribed_parent = parentSub
372+ , _cacheSubscribed_occurrence = occRef
373+#ifdef DEBUG_NODEIDS
374+ , _cacheSubscribed_nodeId = nodeId
375+#endif
376+ }
377+ subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378+ liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379+ return subscribedTicket
380+ liftIO $ cacheSubscription sub mSubscribedRef subscribedTicket
381+
382+cacheSubscription :: Subscriber x a -> IORef (FastWeak (CacheSubscribed x a))
383+ -> FastWeakTicket (CacheSubscribed x a) -> IO (EventSubscription x, Maybe a)
384+cacheSubscription sub mSubscribedRef subscribedTicket = do
385+ subscribed <- getFastWeakTicketValue subscribedTicket
386+ ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
387+ occ <- readIORef $ _cacheSubscribed_occurrence subscribed
388+
389+ let parentSub = _cacheSubscribed_parent subscribed
390+ es = EventSubscription
391+ { _eventSubscription_unsubscribe = do
392+ FastWeakBag.remove ticket
393+
394+ isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
395+ when isEmpty $ do
396+ writeIORef mSubscribedRef emptyFastWeak
397+ unsubscribe parentSub
398+ touch ticket
399+ touch subscribedTicket
400+ , _eventSubscription_subscribed = EventSubscribed
401+ { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub
402+ , eventSubscribedRetained = toAny subscribedTicket
403+#ifdef DEBUG_CYCLES
404+ , eventSubscribedGetParents = return [_eventSubscription_subscribed parentSub]
405+ , eventSubscribedHasOwnHeightRef = False
406+ , eventSubscribedWhoCreated = whoCreatedIORef mSubscribedRef
407+#endif
408+ }
409+ }
410+ return (es, occ)
208411
209−eventFan :: GCompare k => k a -> Fan x k -> Event x a
210−eventFan !k !f = Event $ wrap (EventSubscribedFan k) $ getFanSubscribed k f
211412
212−eventSwitch :: Switch x a -> Event x a
213−eventSwitch !s = Event $ wrap EventSubscribedSwitch $ getSwitchSubscribed s
413+subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
414+subscribe e s = fst <$> subscribeAndRead e s
214415
215−eventCoincidence :: Coincidence x a -> Event x a
216−eventCoincidence !c = Event $ wrap EventSubscribedCoincidence $ getCoincidenceSubscribed c
416+{-# INLINE wrap #-}
417+wrap :: MonadIO m => (t -> EventSubscribed x) -> (Subscriber x a -> m (WeakBagTicket, t, Maybe a)) -> Subscriber x a -> m (EventSubscription x, Maybe a)
418+wrap tag getSpecificSubscribed sub = do
419+ (sln, subd, occ) <- getSpecificSubscribed sub
420+ let es = tag subd
421+ return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
217422
218−eventHold :: (a ~ p b, R.Patch p) => Hold x p b -> Event x a
219−eventHold !h = Event $ subscribeHoldEvent h
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
220425
221−eventDyn :: (a ~ p b, R.Patch p) => Dyn x p b -> Event x a
222−eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
426+subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427+subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428+
429+eventNever :: Event x a
430+eventNever = Event $ const subscribeAndReadNever
431+
432+eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
433+eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
223434
224−eventHoldIdentity :: (a ~ Identity b) => Hold x Identity b -> Event x a
225−eventHoldIdentity !h = Event $ subscribeHoldEvent h
435+eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
436+eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
226437
227−eventDynIdentity :: (a ~ Identity b) => Dyn x Identity b -> Event x a
228−eventDynIdentity !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
438+eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
439+eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
440+
441+eventHold :: Hold x p -> Event x p
442+eventHold !h = Event $ subscribeHoldEvent h
443+
444+eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
445+eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
229446
230447{-# INLINE subscribeCoincidenceInner #-}
231−subscribeCoincidenceInner :: CanSubscribe x m => Event x a -> Height -> CoincidenceSubscribed x a -> m (Maybe a, Height, EventSubscribed x a)
448+subscribeCoincidenceInner :: HasSpiderTimeline x => Event x a -> Height -> CoincidenceSubscribed x a -> EventM x (Maybe a, Height, EventSubscribed x)
232449subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
233450 subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
234− subscription@(EventSubscription _ innerSubd) <- subscribe inner subInner
235− innerOcc <- liftIO $ readEventSubscribed innerSubd
451+ (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
236452 innerHeight <- liftIO $ getEventSubscribedHeight innerSubd
237453 let height = max innerHeight outerHeight
238454 defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
239455 return (innerOcc, height, innerSubd)
240456
457+--------------------------------------------------------------------------------
458+-- Subscriber
459+--------------------------------------------------------------------------------
460+
461+data Subscriber x a = Subscriber
462+ { subscriberPropagate :: !(a -> EventM x ())
463+ , subscriberInvalidateHeight :: !(Height -> IO ())
464+ , subscriberRecalculateHeight :: !(Height -> IO ())
465+ }
466+
467+newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
468+newSubscriberHold h = return $ Subscriber
469+ { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
470+ , subscriberInvalidateHeight = \_ -> return ()
471+ , subscriberRecalculateHeight = \_ -> return ()
472+ }
473+
474+newSubscriberFan :: forall x k v. (HasSpiderTimeline x, GCompare k) => FanSubscribed x k v -> IO (Subscriber x (DMap k v))
475+newSubscriberFan subscribed = debugSubscriber ("SubscriberFan " <> showNodeId subscribed) $ Subscriber
476+ { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
477+ subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
478+ tracePropagate (Proxy :: Proxy x) $ show (DMap.size subs) <> " keys subscribed, " <> show (DMap.size a) <> " keys firing"
479+ liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
480+ scheduleClear $ fanSubscribedOccurrence subscribed
481+ let f _ (Pair v subsubs) = do
482+ propagate v $ _fanSubscribedChildren_list subsubs
483+ return $ Constant ()
484+ _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
485+ return ()
486+ , subscriberInvalidateHeight = \old -> do
487+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
489+ , subscriberRecalculateHeight = \new -> do
490+ subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
492+ }
493+
494+newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495+newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
496+ { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
497+ liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
498+ scheduleClear $ switchSubscribedOccurrence subscribed
499+ propagate a $ switchSubscribedSubscribers subscribed
500+ , subscriberInvalidateHeight = \_ -> do
501+ oldHeight <- readIORef $ switchSubscribedHeight subscribed
502+ when (oldHeight /= invalidHeight) $ do
503+ writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504+ WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505+ , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506+ }
507+
508+newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
509+newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
510+ { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
511+ outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
512+ tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
513+ (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
514+ tracePropagate (Proxy :: Proxy x) $ " isJust occ = " <> show (isJust occ)
515+ tracePropagate (Proxy :: Proxy x) $ " innerHeight = " <> show innerHeight
516+
517+ liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518+ scheduleClear $ coincidenceSubscribedInnerParent subscribed
519+ case occ of
520+ Nothing ->
521+ when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522+ writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525+ Just o -> do -- Since it's already firing, no need to adjust height
526+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
528+ propagate o $ coincidenceSubscribedSubscribers subscribed
529+ , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530+ , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
531+ }
532+
533+newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
534+newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoincidenceInner" <> showNodeId subscribed) $ Subscriber
535+ { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
536+ occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
537+ case occ of
538+ Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
539+ Nothing -> do
540+ liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
541+ scheduleClear $ coincidenceSubscribedOccurrence subscribed
542+ propagate a $ coincidenceSubscribedSubscribers subscribed
543+ , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544+ , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
545+ }
546+
547+invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
548+invalidateSubscriberHeight = flip subscriberInvalidateHeight
549+
550+recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551+recalculateSubscriberHeight = flip subscriberRecalculateHeight
552+
553+-- | Propagate everything at the current height
554+propagate :: forall x a. HasSpiderTimeline x => a -> WeakBag (Subscriber x a) -> EventM x ()
555+propagate a subscribers = withIncreasedDepth (Proxy::Proxy x) $
556+ -- Note: in the following traversal, we do not visit nodes that are added to the list during our traversal; they are new events, which will necessarily have full information already, so there is no need to traverse them
557+ --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
558+ WeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
559+
560+-- | Propagate everything at the current height
561+propagateFast :: forall x a. HasSpiderTimeline x => a -> FastWeakBag (Subscriber x a) -> EventM x ()
562+propagateFast a subscribers = withIncreasedDepth (Proxy::Proxy x) $
563+ -- Note: in the following traversal, we do not visit nodes that are added to the list during our traversal; they are new events, which will necessarily have full information already, so there is no need to traverse them
564+ --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
565+ FastWeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
566+
241567--------------------------------------------------------------------------------
242568-- EventSubscribed
243569--------------------------------------------------------------------------------
244570
245−data EventSubscribed x a
246− = EventSubscribedRoot {-# NOUNPACK #-} (RootSubscribed x a)
247− | EventSubscribedNever
248− | forall b. EventSubscribedPush !(PushSubscribed x b a)
249− | forall k. (GCompare k, a ~ DMap k Identity) => EventSubscribedMerge !(MergeSubscribed x k)
250− | forall k. GCompare k => EventSubscribedFan !(k a) !(FanSubscribed x k)
251− | EventSubscribedSwitch !(SwitchSubscribed x a)
252− | EventSubscribedCoincidence !(CoincidenceSubscribed x a)
253−
254−readEventSubscribed :: EventSubscribed x a -> IO (Maybe a)
255−readEventSubscribed = \case
256− EventSubscribedRoot rs -> readRootSubscribed rs
257− EventSubscribedNever -> return Nothing
258− EventSubscribedPush ps -> readPushSubscribed ps
259− EventSubscribedMerge ms -> readMergeSubscribed ms
260− EventSubscribedFan k fs -> readFanSubscribed k fs
261− EventSubscribedSwitch ss -> readSwitchSubscribed ss
262− EventSubscribedCoincidence cs -> readCoincidenceSubscribed cs
263−
264−{-# INLINE subscribeEventSubscribed #-}
265−subscribeEventSubscribed :: EventSubscribed x a -> Subscriber x a -> IO (Maybe (SubscriberListTicket x a))
266−subscribeEventSubscribed es sub = case es of
267− EventSubscribedRoot r -> do
268− traceSubscribe $ "subscribeEventSubscribed Root"
269− Just <$> subscribeRootSubscribed r sub
270− EventSubscribedNever -> do
271− traceSubscribe $ "subscribeEventSubscribed Never"
272− return Nothing
273− EventSubscribedPush subscribed -> do
274− traceSubscribe $ "subscribeEventSubscribed Push"
275− Just <$> subscribePushSubscribed subscribed sub
276− EventSubscribedFan k subscribed -> do
277− traceSubscribe $ "subscribeEventSubscribed Fan"
278− Just <$> subscribeFanSubscribed k subscribed sub
279− EventSubscribedMerge subscribed -> do
280− traceSubscribe $ "subscribeEventSubscribed Merge"
281− Just <$> subscribeMergeSubscribed subscribed sub
282− EventSubscribedSwitch subscribed -> do
283− traceSubscribe $ "subscribeEventSubscribed Switch"
284− Just <$> subscribeSwitchSubscribed subscribed sub
285− EventSubscribedCoincidence subscribed -> do
286− traceSubscribe $ "subscribeEventSubscribed Coincidence"
287− Just <$> subscribeCoincidenceSubscribed subscribed sub
288−
289−{-# INLINE eventSubscribedGetParents #-}
290−eventSubscribedGetParents :: EventSubscribed x a -> IO [Some (EventSubscribed x)]
291−eventSubscribedGetParents = \case
292− EventSubscribedRoot _ -> return []
293− EventSubscribedNever -> return []
294− EventSubscribedPush subscribed -> return [Some.This $ _eventSubscription_subscribed $ pushSubscribedParent subscribed]
295− EventSubscribedFan _ subscribed -> return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
296− EventSubscribedMerge subscribed -> do
297− ps <- readIORef $ mergeSubscribedParents subscribed
298− return $ R.ffor (DMap.toList ps) $ \(_ :=> v) -> Some.This $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription v
299− EventSubscribedSwitch subscribed -> do
300− s <- readIORef $ switchSubscribedCurrentParent subscribed
301− return [Some.This $ _eventSubscription_subscribed s]
302− EventSubscribedCoincidence subscribed -> do
303− innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
304− let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
305− innerParents = maybeToList $ fmap Some.This innerSubscription
306− return $ outerParent : innerParents
307−
308−getEventSubscribedHeight :: EventSubscribed x a -> IO Height
571+toAny :: a -> Any
572+toAny = unsafeCoerce
573+
574+-- Why do we use Any here, instead of just giving eventSubscribedRetained an
575+-- existential type? Sadly, GHC does not currently know how to unbox types
576+-- with existentially quantified fields. So instead we just coerce values
577+-- to type Any on the way in. Since we never coerce them back, this is
578+-- perfectly safe.
579+data EventSubscribed x = EventSubscribed
580+ { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581+ , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
582+#ifdef DEBUG_CYCLES
583+ , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
584+ , eventSubscribedHasOwnHeightRef :: !Bool
585+ , eventSubscribedWhoCreated :: !(IO [String])
586+#endif
587+ }
588+
589+eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x
590+eventSubscribedRoot !r = EventSubscribed
591+ { eventSubscribedHeightRef = zeroRef
592+ , eventSubscribedRetained = toAny r
593+#ifdef DEBUG_CYCLES
594+ , eventSubscribedGetParents = return []
595+ , eventSubscribedHasOwnHeightRef = False
596+ , eventSubscribedWhoCreated = return ["root"]
597+#endif
598+ }
599+
600+eventSubscribedNever :: EventSubscribed x
601+eventSubscribedNever = EventSubscribed
602+ { eventSubscribedHeightRef = zeroRef
603+ , eventSubscribedRetained = toAny ()
604+#ifdef DEBUG_CYCLES
605+ , eventSubscribedGetParents = return []
606+ , eventSubscribedHasOwnHeightRef = False
607+ , eventSubscribedWhoCreated = return ["never"]
608+#endif
609+ }
610+eventSubscribedNow :: EventSubscribed x
611+eventSubscribedNow = EventSubscribed
612+ { eventSubscribedHeightRef = zeroRef
613+ , eventSubscribedRetained = toAny ()
614+#ifdef DEBUG_CYCLES
615+ , eventSubscribedGetParents = return []
616+ , eventSubscribedHasOwnHeightRef = False
617+ , eventSubscribedWhoCreated = return ["now"]
618+#endif
619+ }
620+
621+eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
622+eventSubscribedFan !subscribed = EventSubscribed
623+ { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624+ , eventSubscribedRetained = toAny subscribed
625+#ifdef DEBUG_CYCLES
626+ , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
627+ , eventSubscribedHasOwnHeightRef = False
628+ , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
629+#endif
630+ }
631+
632+eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x
633+eventSubscribedSwitch !subscribed = EventSubscribed
634+ { eventSubscribedHeightRef = switchSubscribedHeight subscribed
635+ , eventSubscribedRetained = toAny subscribed
636+#ifdef DEBUG_CYCLES
637+ , eventSubscribedGetParents = do
638+ s <- readIORef $ switchSubscribedCurrentParent subscribed
639+ return [_eventSubscription_subscribed s]
640+ , eventSubscribedHasOwnHeightRef = True
641+ , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
642+#endif
643+ }
644+
645+eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x
646+eventSubscribedCoincidence !subscribed = EventSubscribed
647+ { eventSubscribedHeightRef = coincidenceSubscribedHeight subscribed
648+ , eventSubscribedRetained = toAny subscribed
649+#ifdef DEBUG_CYCLES
650+ , eventSubscribedGetParents = do
651+ innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
652+ let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653+ innerParents = maybeToList $ innerSubscription
654+ return $ outerParent : innerParents
655+ , eventSubscribedHasOwnHeightRef = True
656+ , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
657+#endif
658+ }
659+
660+getEventSubscribedHeight :: EventSubscribed x -> IO Height
309661getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
310662
311−{-# INLINE eventSubscribedHeightRef #-}
312−eventSubscribedHeightRef :: EventSubscribed x a -> IORef Height
313−eventSubscribedHeightRef = \case
314− EventSubscribedRoot _ -> zeroRef
315− EventSubscribedNever -> zeroRef
316− EventSubscribedPush subscribed -> pushSubscribedHeight subscribed
317− EventSubscribedFan _ subscribed -> eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
318− EventSubscribedMerge subscribed -> mergeSubscribedHeight subscribed
319− EventSubscribedSwitch subscribed -> switchSubscribedHeight subscribed
320− EventSubscribedCoincidence subscribed -> coincidenceSubscribedHeight subscribed
321−
322−whoCreatedEventSubscribed :: EventSubscribed x a -> IO [String]
323−whoCreatedEventSubscribed = \case
324− EventSubscribedRoot _ -> return ["root"]
325− EventSubscribedNever -> return ["never"]
326− EventSubscribedPush subscribed -> whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
327− EventSubscribedFan _ subscribed -> whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
328− EventSubscribedMerge subscribed -> whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
329− EventSubscribedSwitch subscribed -> whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
330− EventSubscribedCoincidence subscribed -> whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
331−
332−{-# INLINE eventSubscribedHasOwnHeightRef #-}
333−eventSubscribedHasOwnHeightRef :: EventSubscribed x a -> Bool
334−eventSubscribedHasOwnHeightRef = \case
335− EventSubscribedRoot _ -> False
336− EventSubscribedNever -> False
337− EventSubscribedPush _ -> False
338− EventSubscribedFan _ _ -> False
339− EventSubscribedMerge _ -> True
340− EventSubscribedSwitch _ -> True
341− EventSubscribedCoincidence _ -> True
342−
343−walkInvalidHeightParents :: EventSubscribed x a -> IO [Some (EventSubscribed x)]
663+#ifdef DEBUG_CYCLES
664+whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
665+whoCreatedEventSubscribed = eventSubscribedWhoCreated
666+
667+walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
344668walkInvalidHeightParents s0 = do
345− subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
669+ subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
346670 h <- liftIO $ readIORef $ eventSubscribedHeightRef s
347671 when (h == invalidHeight) $ do
348672 when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
349− modify (Some.This s :)
673+ modify (s :)
350674 mapM_ loop =<< liftIO (eventSubscribedGetParents s)
351− forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
675+ forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
352676 return subscribers
677+#endif
678+
679+{-# INLINE subscribeHoldEvent #-}
680+subscribeHoldEvent :: Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
681+subscribeHoldEvent = subscribeAndRead . holdEvent
353682
354683--------------------------------------------------------------------------------
355−-- EventSubscription
684+-- Behavior
356685--------------------------------------------------------------------------------
357686
358−data EventSubscription x a = EventSubscription
359− { _eventSubscription_ticket :: !(Maybe (SubscriberListTicket x a))
360− , _eventSubscription_subscribed :: !(EventSubscribed x a)
687+newtype Behavior x a = Behavior { readBehaviorTracked :: BehaviorM x a }
688+
689+behaviorHold :: Hold x p -> Behavior x (PatchTarget p)
690+behaviorHold !h = Behavior $ readHoldTracked h
691+
692+behaviorHoldIdentity :: Hold x (Identity a) -> Behavior x a
693+behaviorHoldIdentity = behaviorHold
694+
695+behaviorConst :: a -> Behavior x a
696+behaviorConst !a = Behavior $ return a
697+
698+behaviorPull :: Pull x a -> Behavior x a
699+behaviorPull !p = Behavior $ do
700+ val <- liftIO $ readIORef $ pullValue p
701+ case val of
702+ Just subscribed -> do
703+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
704+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
705+ liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
706+ return $ pullSubscribedValue subscribed
707+ Nothing -> do
708+ i <- liftIO $ newInvalidatorPull p
709+ wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
710+ parentsRef <- liftIO $ newIORef []
711+ holdInits <- askBehaviorHoldInits
712+ a <- liftIO $ runReaderIO (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
713+ invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
714+ parents <- liftIO $ readIORef parentsRef
715+ let subscribed = PullSubscribed
716+ { pullSubscribedValue = a
717+ , pullSubscribedInvalidators = invsRef
718+ , pullSubscribedOwnInvalidator = i
719+ , pullSubscribedParents = parents
720+ }
721+ liftIO $ writeIORef (pullValue p) $ Just subscribed
722+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
723+ return a
724+
725+behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
726+behaviorDyn !d = Behavior $ readHoldTracked =<< getDynHold d
727+
728+{-# INLINE readHoldTracked #-}
729+readHoldTracked :: Hold x p -> BehaviorM x (PatchTarget p)
730+readHoldTracked h = do
731+ result <- liftIO $ readIORef $ holdValue h
732+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
733+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedHold h)) :))
734+ liftIO $ touch h -- Otherwise, if this gets inlined enough, the hold's parent reference may get collected
735+ return result
736+
737+{-# INLINABLE readBehaviorUntracked #-}
738+readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
739+readBehaviorUntracked b = do
740+ holdInits <- getDeferralQueue
741+ liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
742+
743+--------------------------------------------------------------------------------
744+-- Dynamic
745+--------------------------------------------------------------------------------
746+
747+type DynamicS x p = Dynamic x (PatchTarget p) p
748+
749+data Dynamic x target p = Dynamic
750+ { dynamicCurrent :: !(Behavior x target)
751+ , dynamicUpdated :: Event x p -- This must be lazy; see the comment on holdEvent --TODO: Would this let us eliminate `Dyn`?
361752 }
362753
363−unsubscribe :: EventSubscription x a -> IO ()
364−unsubscribe (EventSubscription msln _) = forM_ msln $ \sln -> WeakBag.remove sln
754+deriving instance (HasSpiderTimeline x) => Functor (Dynamic x target)
755+
756+
757+
758+
759+dynamicHold :: Hold x p -> DynamicS x p
760+dynamicHold !h = Dynamic
761+ { dynamicCurrent = behaviorHold h
762+ , dynamicUpdated = eventHold h
763+ }
764+
765+dynamicHoldIdentity :: Hold x (Identity a) -> DynamicS x (Identity a)
766+dynamicHoldIdentity = dynamicHold
767+
768+dynamicConst :: PatchTarget p -> DynamicS x p
769+dynamicConst !a = Dynamic
770+ { dynamicCurrent = behaviorConst a
771+ , dynamicUpdated = eventNever
772+ }
773+
774+dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> DynamicS x p
775+dynamicDyn !d = Dynamic
776+ { dynamicCurrent = behaviorDyn d
777+ , dynamicUpdated = eventDyn d
778+ }
779+
780+dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> DynamicS x (Identity a)
781+dynamicDynIdentity = dynamicDyn
365782
366783--------------------------------------------------------------------------------
367784-- Combinators
368785--------------------------------------------------------------------------------
369786
370−--TODO: Figure out why certain things are not 'representational', then make them
371−--representational so we can use coerce
372−
373787--type role Hold representational
374−data Hold x p a
375− = Hold { holdValue :: !(IORef a)
788+data Hold x p
789+ = Hold { holdValue :: !(IORef (PatchTarget p))
376790 , holdInvalidators :: !(IORef [Weak (Invalidator x)])
377− , holdParent :: !(IORef (Either (Event x (p a)) (EventSubscription x (p a)))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
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
378793#ifdef DEBUG_NODEIDS
379794 , holdNodeId :: Int
380795#endif
381796 }
382797
798+-- | A statically allocated 'SpiderTimeline'
799+data Global
800+
801+{-# NOINLINE globalSpiderTimelineEnv #-}
802+globalSpiderTimelineEnv :: SpiderTimelineEnv Global
803+globalSpiderTimelineEnv = unsafePerformIO unsafeNewSpiderTimelineEnv
804+
805+-- | Stores all global data relevant to a particular Spider timeline; only one
806+-- value should exist for each type @x@
807+newtype SpiderTimelineEnv x = STE {unSTE :: SpiderTimelineEnv' x}
808+-- We implement SpiderTimelineEnv with a newtype wrapper so
809+-- we can get the coercions we want safely.
810+type role SpiderTimelineEnv nominal
811+
812+data SpiderTimelineEnv' x = SpiderTimelineEnv
813+ { _spiderTimeline_lock :: {-# UNPACK #-} !(MVar ())
814+ , _spiderTimeline_eventEnv :: {-# UNPACK #-} !(EventEnv x)
815+#ifdef DEBUG
816+ , _spiderTimeline_depth :: {-# UNPACK #-} !(IORef Int)
817+#endif
818+ }
819+type role SpiderTimelineEnv' phantom
820+
821+instance Eq (SpiderTimelineEnv x) where
822+ _ == _ = True -- Since only one exists of each type
823+
824+instance GEq SpiderTimelineEnv where
825+ a `geq` b = if _spiderTimeline_lock (unSTE a) == _spiderTimeline_lock (unSTE b)
826+ then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderTimelineEnv can't have two different 'x' arguments
827+ else Nothing
828+
383829data EventEnv x
384− = EventEnv { eventEnvSpiderEnv :: !(SpiderEnv x)
385− , eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
830+ = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
386831 , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
832+ , eventEnvDynInits :: !(IORef [SomeDynInit x])
387833 , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
388834 , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
389− , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
390− , eventEnvRootClears :: !(IORef [SomeRootClear])
835+ , eventEnvClears :: !(IORef [Some Clear]) -- Needed for Subscribe
836+ , eventEnvIntClears :: !(IORef [Some IntClear])
837+ , eventEnvRootClears :: !(IORef [Some RootClear])
391838 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
392839 , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
393− , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge x]))
840+ , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
394841 }
395842
396843{-# INLINE runEventM #-}
397−runEventM :: EventM x a -> EventEnv x -> IO a
398−runEventM = runReaderT . unEventM
844+runEventM :: EventM x a -> IO a
845+runEventM = unEventM
846+
847+asksEventEnv :: forall x a. HasSpiderTimeline x => (EventEnv x -> a) -> EventM x a
848+asksEventEnv f = return $ f $ _spiderTimeline_eventEnv (unSTE (spiderTimeline :: SpiderTimelineEnv x))
399849
400850class MonadIO m => Defer a m where
401851 getDeferralQueue :: m (IORef [a])
@@ -406,91 +856,98 @@ defer a = do
406856 q <- getDeferralQueue
407857 liftIO $ modifyIORef' q (a:)
408858
409−instance Defer (SomeAssignment x) (EventM x) where
859+instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
860+ {-# INLINE getDeferralQueue #-}
861+ getDeferralQueue = asksEventEnv eventEnvAssignments
862+
863+instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
410864 {-# INLINE getDeferralQueue #-}
411− getDeferralQueue = EventM $ asks eventEnvAssignments
865+ getDeferralQueue = asksEventEnv eventEnvHoldInits
412866
413−instance Defer (SomeHoldInit x) (EventM x) where
867+instance HasSpiderTimeline x => Defer (SomeDynInit x) (EventM x) where
414868 {-# INLINE getDeferralQueue #-}
415− getDeferralQueue = EventM $ asks eventEnvHoldInits
869+ getDeferralQueue = asksEventEnv eventEnvDynInits
416870
417871instance Defer (SomeHoldInit x) (BehaviorM x) where
418872 {-# INLINE getDeferralQueue #-}
419873 getDeferralQueue = BehaviorM $ asks snd
420874
421−instance Defer (SomeMergeUpdate x) (EventM x) where
875+instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
422876 {-# INLINE getDeferralQueue #-}
423− getDeferralQueue = EventM $ asks eventEnvMergeUpdates
877+ getDeferralQueue = asksEventEnv eventEnvMergeUpdates
424878
425−instance Defer (SomeMergeInit x) (EventM x) where
879+instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
426880 {-# INLINE getDeferralQueue #-}
427− getDeferralQueue = EventM $ asks eventEnvMergeInits
881+ getDeferralQueue = asksEventEnv eventEnvMergeInits
428882
429−class HasCurrentHeight x m | m -> x where
883+class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
430884 getCurrentHeight :: m Height
431− scheduleMerge :: Height -> MergeSubscribed x a -> m ()
885+ scheduleMerge :: Height -> EventM x () -> m ()
432886
433−instance HasCurrentHeight x (EventM x) where
887+instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
434888 {-# INLINE getCurrentHeight #-}
435− getCurrentHeight = EventM $ do
436− heightRef <- asks eventEnvCurrentHeight
889+ getCurrentHeight = do
890+ heightRef <- asksEventEnv eventEnvCurrentHeight
437891 liftIO $ readIORef heightRef
438892 {-# INLINE scheduleMerge #-}
439− scheduleMerge height subscribed = EventM $ do
440− delayedRef <- asks eventEnvDelayedMerges
441− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
893+ scheduleMerge height subscribed = do
894+ delayedRef <- asksEventEnv eventEnvDelayedMerges
895+ liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
442896
443−class HasSpiderEnv x m | m -> x where
444− -- | Retrieve the current SpiderEnv
445− askSpiderEnv :: m (SpiderEnv x)
897+class HasSpiderTimeline x where
898+ -- | Retrieve the current SpiderTimelineEnv
899+ spiderTimeline :: SpiderTimelineEnv x
446900
447−instance HasSpiderEnv x (EventM x) where
448− {-# INLINE askSpiderEnv #-}
449− askSpiderEnv = EventM $ asks eventEnvSpiderEnv
901+instance HasSpiderTimeline Global where
902+ spiderTimeline = globalSpiderTimelineEnv
450903
451−instance HasSpiderEnv x (SpiderHost x) where
452− {-# INLINE askSpiderEnv #-}
453− askSpiderEnv = SpiderHost ask
454−
455−putCurrentHeight :: Height -> EventM x ()
456−putCurrentHeight h = EventM $ do
457− heightRef <- asks eventEnvCurrentHeight
904+putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
905+putCurrentHeight h = do
906+ heightRef <- asksEventEnv eventEnvCurrentHeight
458907 liftIO $ writeIORef heightRef $! h
459908
460−instance Defer SomeClear (EventM x) where
909+instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
461910 {-# INLINE getDeferralQueue #-}
462− getDeferralQueue = EventM $ asks eventEnvClears
911+ getDeferralQueue = asksEventEnv eventEnvClears
463912
464913{-# INLINE scheduleClear #-}
465−scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
466−scheduleClear r = defer $ SomeClear r
914+scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
915+scheduleClear r = defer $ Some $ Clear r
916+
917+instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
918+ {-# INLINE getDeferralQueue #-}
919+ getDeferralQueue = asksEventEnv eventEnvIntClears
467920
468−instance Defer SomeRootClear (EventM x) where
921+{-# INLINE scheduleIntClear #-}
922+scheduleIntClear :: Defer (Some IntClear) m => IORef (IntMap a) -> m ()
923+scheduleIntClear r = defer $ Some $ IntClear r
924+
925+instance HasSpiderTimeline x => Defer (Some RootClear) (EventM x) where
469926 {-# INLINE getDeferralQueue #-}
470− getDeferralQueue = EventM $ asks eventEnvRootClears
927+ getDeferralQueue = asksEventEnv eventEnvRootClears
471928
472929{-# INLINE scheduleRootClear #-}
473−scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
474−scheduleRootClear r = defer $ SomeRootClear r
930+scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
931+scheduleRootClear r = defer $ Some $ RootClear r
475932
476−instance Defer (SomeResetCoincidence x) (EventM x) where
933+instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
477934 {-# INLINE getDeferralQueue #-}
478− getDeferralQueue = EventM $ asks eventEnvResetCoincidences
935+ getDeferralQueue = asksEventEnv eventEnvResetCoincidences
479936
480937-- Note: hold cannot examine its event until after the phase is over
481−{-# SPECIALIZE hold :: R.Patch p => a -> Event x (p a) -> EventM x (Hold x p a) #-}
482−{-# SPECIALIZE hold :: R.Patch p => a -> Event x (p a) -> ComputeM x (Hold x p a) #-}
483−hold :: (R.Patch p, Defer (SomeHoldInit x) m) => a -> Event x (p a) -> m (Hold x p a)
938+{-# INLINE [1] hold #-}
939+hold :: (Patch p, Defer (SomeHoldInit x) m) => PatchTarget p -> Event x p -> m (Hold x p)
484940hold v0 e = do
485941 valRef <- liftIO $ newIORef v0
486942 invsRef <- liftIO $ newIORef []
487− parentRef <- liftIO $ newIORef $ Left e
943+ parentRef <- liftIO $ newIORef Nothing
488944#ifdef DEBUG_NODEIDS
489945 nodeId <- liftIO newNodeId
490946#endif
491947 let h = Hold
492948 { holdValue = valRef
493949 , holdInvalidators = invsRef
950+ , holdEvent = e
494951 , holdParent = parentRef
495952#ifdef DEBUG_NODEIDS
496953 , holdNodeId = nodeId
@@ -500,35 +957,35 @@ hold v0 e = do
500957 return h
501958
502959{-# INLINE getHoldEventSubscription #-}
503−getHoldEventSubscription :: forall m p a x. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer SomeClear m, R.Patch p, HasCurrentHeight x m, Defer (SomeMergeInit x) m, Defer (SomeResetCoincidence x) m, HasSpiderEnv x m, m ~ EventM x) => Hold x p a -> m (EventSubscription x (p a))
960+getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
504961getHoldEventSubscription h = do
505962 ep <- liftIO $ readIORef $ holdParent h
506963 case ep of
507− Right subd -> return subd
508− Left e -> do
964+ Just subd -> return subd
965+ Nothing -> do
966+ let e = holdEvent h
509967 subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
510− subscription@(EventSubscription _ subd) <- subscribe e =<< liftIO (newSubscriberHold h)
968+ (subscription@(EventSubscription _ _), occ) <- subscribeAndRead e =<< liftIO (newSubscriberHold h)
511969 liftIO $ writeIORef subscriptionRef $! subscription
512− occ <- liftIO $ readEventSubscribed subd
513970 case occ of
514971 Nothing -> return ()
515972 Just o -> do
516973 old <- liftIO $ readIORef $ holdValue h
517− case R.apply o old of
974+ case apply o old of
518975 Nothing -> return ()
519976 Just new -> do
520977 -- Need to evaluate these so that we don't retain the Hold itself
521978 v <- liftIO $ evaluate $ holdValue h
522979 i <- liftIO $ evaluate $ holdInvalidators h
523980 defer $ SomeAssignment v i new
524− liftIO $ writeIORef (holdParent h) $ Right subscription
981+ liftIO $ writeIORef (holdParent h) $ Just subscription
525982 return subscription
526983
527984type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
528985
529−--type role BehaviorM representational
530986-- BehaviorM can sample behaviors
531−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderT (BehaviorEnv x) IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
987+newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988+ deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
532989
533990instance Monad (BehaviorM x) where
534991 {-# INLINE (>>=) #-}
@@ -537,14 +994,16 @@ instance Monad (BehaviorM x) where
537994 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
538995 {-# INLINE return #-}
539996 return x = BehaviorM $ return x
997+#if !MIN_VERSION_base(4,13,0)
540998 {-# INLINE fail #-}
541999 fail s = BehaviorM $ fail s
1000+#endif
5421001
5431002data BehaviorSubscribed x a
544− = forall p. BehaviorSubscribedHold (Hold x p a)
1003+ = forall p. BehaviorSubscribedHold (Hold x p)
5451004 | BehaviorSubscribedPull (PullSubscribed x a)
5461005
547−data SomeBehaviorSubscribed x = forall a. SomeBehaviorSubscribed (BehaviorSubscribed x a)
1006+newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
5481007
5491008--type role PullSubscribed representational
5501009data PullSubscribed x a
@@ -570,7 +1029,7 @@ data Invalidator x
5701029data RootSubscribed x a = forall k. GCompare k => RootSubscribed
5711030 { rootSubscribedKey :: !(k a)
5721031 , rootSubscribedCachedSubscribed :: !(IORef (DMap k (RootSubscribed x))) -- From the original Root
573− , rootSubscribedSubscribers :: !(SubscriberList x a)
1032+ , rootSubscribedSubscribers :: !(WeakBag (Subscriber x a))
5741033 , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
5751034 , rootSubscribedUninit :: IO ()
5761035 , 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?
@@ -579,55 +1038,33 @@ data RootSubscribed x a = forall k. GCompare k => RootSubscribed
5791038#endif
5801039 }
5811040
582−data Root x (k :: * -> *)
1041+data Root x k
5831042 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
5841043 , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
5851044 , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
5861045 }
5871046
588−data SomeHoldInit x = forall p a. R.Patch p => SomeHoldInit !(Hold x p a)
1047+data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
5891048
590−data SomeMergeUpdate x = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap (DMap k (Event x))) (MergeSubscribed x k)
1049+data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
5911050
592−data SomeMergeInit x = forall k. GCompare k => SomeMergeInit !(MergeSubscribed x k) !(Event x (R.PatchDMap (DMap k (Event x))))
1051+data SomeMergeUpdate x = SomeMergeUpdate
1052+ { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
1053+ , _someMergeUpdate_invalidateHeight :: !(IO ())
1054+ , _someMergeUpdate_recalculateHeight :: !(IO ())
1055+ }
5931056
594−data SomeEventSubscription x = forall a. SomeEventSubscription (EventSubscription x a)
1057+newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
5951058
5961059-- EventM can do everything BehaviorM can, plus create holds
597−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
598−
599−data PushSubscribed x a b
600− = PushSubscribed { pushSubscribedCachedSubscribed :: !(IORef (Maybe (PushSubscribed x a b)))
601− , 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)
602− , pushSubscribedHeight :: !(IORef Height)
603− , pushSubscribedSubscribers :: !(SubscriberList x b)
604− , pushSubscribedSelf :: !(Subscriber x a) -- Hold this in memory to ensure our WeakReferences don't die --TODO: Probably unneeded now
605− , pushSubscribedWeakSelf :: !(IORef (Weak (PushSubscribed x a b)))
606− , pushSubscribedParent :: !(EventSubscription x a)
607−#ifdef DEBUG_NODEIDS
608− , pushSubscribedNodeId :: Int
609−#endif
610− }
611−
612−newtype ComputeM x a = ComputeM (ReaderT (IORef [SomeHoldInit x]) IO a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1060+newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
6131061
614−instance Defer (SomeHoldInit x) (ComputeM x) where
615− getDeferralQueue = ComputeM ask
1062+newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
6161063
617−{-# SPECIALIZE runComputeM :: ComputeM x a -> EventM x a #-}
618−runComputeM :: Defer (SomeHoldInit x) m => ComputeM x a -> m a
619−runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
620−
621−data Push x a b
622− = Push { pushCompute :: !(a -> ComputeM x (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?)
623− , pushParent :: !(Event x a)
624− , pushSubscribed :: !(IORef (Maybe (PushSubscribed x a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
625− }
626−
627−data MergeSubscribedParent (x :: *) k a = MergeSubscribedParent !(EventSubscription x a) !(Subscriber x a)
628−
629−mergeSubscribedParentSubscription :: MergeSubscribedParent x k a -> EventSubscription x a
630−mergeSubscribedParentSubscription (MergeSubscribedParent es _) = es
1064+data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
1065+ { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
1066+ , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
1067+ }
6311068
6321069data HeightBag = HeightBag
6331070 { _heightBag_size :: {-# UNPACK #-} !Int
@@ -645,7 +1082,8 @@ heightBagFromList :: [Height] -> HeightBag
6451082heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
6461083
6471084heightBagAdd :: Height -> HeightBag -> HeightBag
648−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1085+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086+ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
6491087
6501088heightBagRemove :: Height -> HeightBag -> HeightBag
6511089heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -654,6 +1092,13 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
6541092 0 -> IntMap.delete h c
6551093 _ -> IntMap.insert h (pred old) c
6561094
1095+heightBagRemoveMaybe :: Height -> HeightBag -> Maybe HeightBag
1096+heightBagRemoveMaybe (Height h) b@(HeightBag s c) = heightBagVerify . removed <$> IntMap.lookup h c where
1097+ removed old = HeightBag (pred s) $ case old of
1098+ 0 -> IntMap.delete h c
1099+ _ -> IntMap.insert h (pred old) c
1100+
1101+
6571102heightBagMax :: HeightBag -> Height
6581103heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
6591104 Just ((h, _), _) -> Height h
@@ -671,57 +1116,37 @@ heightBagVerify b@(HeightBag s c) = if
6711116heightBagVerify = id
6721117#endif
6731118
674−data MergeSubscribed x k
675− = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed x k))) -- From the original merge
676− , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
677− , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
678− , mergeSubscribedHeight :: !(IORef Height)
679− , mergeSubscribedHeightBag :: !(IORef HeightBag)
680− , mergeSubscribedSubscribers :: !(SubscriberList x (DMap k Identity))
681− , mergeSubscribedChange :: !(IORef (Subscriber x (R.PatchDMap (DMap k (Event x))), EventSubscribed x (R.PatchDMap (DMap k (Event x)))))
682− , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent x k)))
683− , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed x k)))
684−#ifdef DEBUG_NODEIDS
685− , mergeSubscribedNodeId :: Int
686−#endif
687− }
688−
689−--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
690−data Merge x k
691− = Merge { mergeParents :: !(Dynamic x R.PatchDMap (DMap k (Event x)))
692− , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed x k)))
693− }
694−
695−data FanSubscribedChildren (x :: *) k a = FanSubscribedChildren
696− { _fanSubscribedChildren_list :: !(SubscriberList x a)
697− , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k)
698− , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k)))
1119+data FanSubscribedChildren x k v a = FanSubscribedChildren
1120+ { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x (v a)))
1121+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k v)
1122+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k v)))
6991123 }
7001124
701−data FanSubscribed (x :: *) k
702− = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
703− , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k))) -- This DMap should never be empty
704− , fanSubscribedParent :: !(EventSubscription x (DMap k Identity))
1125+data FanSubscribed x k v
1126+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
1127+ , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k v)))
1128+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k v))) -- This DMap should never be empty
1129+ , fanSubscribedParent :: !(EventSubscription x)
7051130#ifdef DEBUG_NODEIDS
7061131 , fanSubscribedNodeId :: Int
7071132#endif
7081133 }
7091134
710−data Fan x k
711− = Fan { fanParent :: !(Event x (DMap k Identity))
712− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
1135+data Fan x k v
1136+ = Fan { fanParent :: !(Event x (DMap k v))
1137+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
7131138 }
7141139
7151140data SwitchSubscribed x a
7161141 = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
7171142 , switchSubscribedOccurrence :: !(IORef (Maybe a))
7181143 , switchSubscribedHeight :: !(IORef Height)
719− , switchSubscribedSubscribers :: !(SubscriberList x a)
1144+ , switchSubscribedSubscribers :: !(WeakBag (Subscriber x a))
7201145 , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !(Invalidator x)
7211146 , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak (Invalidator x)))
7221147 , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed x])
7231148 , switchSubscribedParent :: !(Behavior x (Event x a))
724− , switchSubscribedCurrentParent :: !(IORef (EventSubscription x a))
1149+ , switchSubscribedCurrentParent :: !(IORef (EventSubscription x))
7251150 , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed x a)))
7261151#ifdef DEBUG_NODEIDS
7271152 , switchSubscribedNodeId :: Int
@@ -733,15 +1158,17 @@ data Switch x a
7331158 , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
7341159 }
7351160
1161+#ifdef USE_TEMPLATE_HASKELL
7361162{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1163+#endif
7371164data CoincidenceSubscribed x a
7381165 = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
7391166 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
740− , coincidenceSubscribedSubscribers :: !(SubscriberList x a)
1167+ , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
7411168 , coincidenceSubscribedHeight :: !(IORef Height)
7421169 , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber x (Event x a))
743− , coincidenceSubscribedOuterParent :: !(EventSubscription x (Event x a))
744− , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x a)))
1170+ , coincidenceSubscribedOuterParent :: !(EventSubscription x)
1171+ , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x)))
7451172 , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed x a)))
7461173#ifdef DEBUG_NODEIDS
7471174 , coincidenceSubscribedNodeId :: Int
@@ -753,67 +1180,6 @@ data Coincidence x a
7531180 , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
7541181 }
7551182
756−data Subscriber x a
757− = forall b. SubscriberPush (a -> ComputeM x (Maybe b)) (PushSubscribed x a b) --TODO: Why does this have the pushCompute in it?
758− | forall k. GCompare k => SubscriberMerge !(k a) (MergeSubscribed x k) --TODO: Can we inline the GCompare?
759− | forall k. (a ~ R.PatchDMap (DMap k (Event x)), GCompare k) => SubscriberMergeChange (MergeSubscribed x k)
760− | forall k. (GCompare k, a ~ DMap k Identity) => SubscriberFan (FanSubscribed x k)
761− | forall p b. (a ~ p b, R.Patch p) => SubscriberHold !(Hold x p b)
762− | forall b. (a ~ Identity b) => SubscriberHoldIdentity !(Hold x Identity b)
763− | SubscriberSwitch (SwitchSubscribed x a)
764− | forall b. a ~ Event x b => SubscriberCoincidenceOuter (CoincidenceSubscribed x b)
765− | SubscriberCoincidenceInner (CoincidenceSubscribed x a)
766− | SubscriberHandle
767−
768−-- These function are constructor functions that are marked NOINLINE so they are
769−-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
770−-- so any weak references that are attached to the constructors will have their
771−-- finalizer run. Using the opaque constructor, does not see the
772−-- constructor application, so it behaves like an IORef and cannot be fused away.
773−--
774−-- The result is also evaluated to WHNF, since forcing a thunk invalidates
775−-- the weak pointer to it in some cases.
776−
777−--TODO: I think all of these noinlines are now unnecessary
778−{-# NOINLINE newSubscriberPush #-}
779−newSubscriberPush :: (a -> ComputeM x (Maybe b)) -> PushSubscribed x a b -> IO (Subscriber x a)
780−newSubscriberPush compute subd = return $! SubscriberPush compute subd
781−
782−{-# RULES
783− "newSubscriberHold/Identity" forall h. newSubscriberHold h = newSubscriberHoldIdentity h
784− #-}
785−{-# NOINLINE newSubscriberHold #-}
786−newSubscriberHold :: R.Patch p => Hold x p a -> IO (Subscriber x (p a))
787−newSubscriberHold h = return $! SubscriberHold h
788−
789−{-# NOINLINE newSubscriberHoldIdentity #-}
790−newSubscriberHoldIdentity :: Hold x Identity a -> IO (Subscriber x (Identity a))
791−newSubscriberHoldIdentity h = return $! SubscriberHoldIdentity h
792−
793−{-# NOINLINE newSubscriberMerge #-}
794−newSubscriberMerge :: GCompare k => k a -> MergeSubscribed x k -> IO (Subscriber x a)
795−newSubscriberMerge k subd = return $! SubscriberMerge k subd
796−
797−{-# NOINLINE newSubscriberMergeChange #-}
798−newSubscriberMergeChange :: GCompare k => MergeSubscribed x k -> IO (Subscriber x (R.PatchDMap (DMap k (Event x))))
799−newSubscriberMergeChange subd = return $! SubscriberMergeChange subd
800−
801−{-# NOINLINE newSubscriberFan #-}
802−newSubscriberFan :: GCompare k => FanSubscribed x k -> IO (Subscriber x (DMap k Identity))
803−newSubscriberFan subd = return $! SubscriberFan subd
804−
805−{-# NOINLINE newSubscriberSwitch #-}
806−newSubscriberSwitch :: SwitchSubscribed x a -> IO (Subscriber x a)
807−newSubscriberSwitch subd = return $! SubscriberSwitch subd
808−
809−{-# NOINLINE newSubscriberCoincidenceOuter #-}
810−newSubscriberCoincidenceOuter :: CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
811−newSubscriberCoincidenceOuter subd = return $! SubscriberCoincidenceOuter subd
812−
813−{-# NOINLINE newSubscriberCoincidenceInner #-}
814−newSubscriberCoincidenceInner :: CoincidenceSubscribed x a -> IO (Subscriber x a)
815−newSubscriberCoincidenceInner subd = return $! SubscriberCoincidenceInner subd
816−
8171183{-# NOINLINE newInvalidatorSwitch #-}
8181184newInvalidatorSwitch :: SwitchSubscribed x a -> IO (Invalidator x)
8191185newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
@@ -822,156 +1188,111 @@ newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
8221188newInvalidatorPull :: Pull x a -> IO (Invalidator x)
8231189newInvalidatorPull p = return $! InvalidatorPull p
8241190
825−data Dynamic x p a
826− = DynamicHold !(Hold x p a)
827− | p ~ Identity => DynamicHoldIdentity !(Hold x Identity a)
828− | DynamicConst !a
829− | DynamicDyn !(Dyn x p a)
830− | p ~ Identity => DynamicDynIdentity !(Dyn x Identity a)
831−
832−{-# INLINE current #-}
833−current :: R.Patch p => Dynamic x p a -> Behavior x a
834−current = \case
835− DynamicHold h -> BehaviorHold h
836− DynamicHoldIdentity h -> BehaviorHoldIdentity h
837− DynamicConst a -> BehaviorConst a
838− DynamicDyn d -> BehaviorDyn d
839− DynamicDynIdentity d -> BehaviorDynIdentity d
840−
841−--TODO: If you only need updated, not current, can we avoid actually constructing the Hold?
842−{-# INLINE updated #-}
843−updated :: R.Patch p => Dynamic x p a -> Event x (p a)
844−updated = \case
845− DynamicHold h -> eventHold h
846− DynamicHoldIdentity h -> eventHoldIdentity h
847− DynamicConst _ -> eventNever
848− DynamicDyn d -> eventDyn d
849− DynamicDynIdentity d -> eventDynIdentity d
850−
851−newMapDyn :: (a -> b) -> Dynamic x Identity a -> Dynamic x Identity b
852−newMapDyn f d = DynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ current d) (Identity . f . runIdentity <$> updated d)
853−
854−instance Functor (Dynamic x Identity) where
855− fmap = newMapDyn
856−
857−instance Applicative (Dynamic x Identity) where
858− pure = DynamicConst
859− (<*>) = zipDynWith ($)
860− _ *> b = b
861− a <* _ = a
862−
863−instance R.FunctorMaybe (Event x) where
864− fmapMaybe f = push $ return . f
865−
866−instance Align (Event x) where
1191+instance HasSpiderTimeline x => Filterable (Event x) where
1192+ mapMaybe f = push $ return . f
1193+
1194+instance HasSpiderTimeline x => Align (Event x) where
8671195 nil = eventNever
868− align ea eb = R.fmapMaybe R.dmapToThese $ merge $ DynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
1196+#if MIN_VERSION_these(0, 8, 0)
1197+instance HasSpiderTimeline x => Semialign (Event x) where
1198+#endif
1199+ align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
1200+ DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
1201+
1202+#ifdef MIN_VERSION_semialign
1203+#if MIN_VERSION_semialign(1,1,0)
1204+instance HasSpiderTimeline x => Zip (Event x) where
1205+#endif
1206+ zip x y = mapMaybe justThese $ align x y
1207+#endif
1208+
1209+data DynType x p = UnsafeDyn !(BehaviorM x (PatchTarget p), Event x p)
1210+ | BuildDyn !(EventM x (PatchTarget p), Event x p)
1211+ | HoldDyn !(Hold x p)
1212+
1213+newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
1214+
1215+newMapDyn :: HasSpiderTimeline x => (a -> b) -> DynamicS x (Identity a) -> DynamicS x (Identity b)
1216+newMapDyn f d = dynamicDynIdentity $ unsafeBuildDynamic (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
8691217
8701218--TODO: Avoid the duplication between this and R.zipDynWith
871−zipDynWith :: (a -> b -> c) -> Dynamic x Identity a -> Dynamic x Identity b -> Dynamic x Identity c
1219+zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> DynamicS x (Identity a) -> DynamicS x (Identity b) -> DynamicS x (Identity c)
8721220zipDynWith f da db =
873− let eab = align (updated da) (updated db)
1221+ let eab = align (dynamicUpdated da) (dynamicUpdated db)
8741222 ec = flip push eab $ \o -> do
8751223 (a, b) <- case o of
8761224 This (Identity a) -> do
877− b <- readBehaviorUntracked $ current db
1225+ b <- readBehaviorUntracked $ dynamicCurrent db
8781226 return (a, b)
8791227 That (Identity b) -> do
880− a <- readBehaviorUntracked $ current da
1228+ a <- readBehaviorUntracked $ dynamicCurrent da
8811229 return (a, b)
8821230 These (Identity a) (Identity b) -> return (a, b)
8831231 return $ Just $ Identity $ f a b
884− in DynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (current da) <*> readBehaviorUntracked (current db)) ec
1232+ in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
8851233
886−instance Monad (Dynamic x Identity) where
887− {-# INLINE return #-}
888− return = pure
889− {-# INLINE (>>=) #-}
890− x >>= f = DynamicDynIdentity $ newJoinDyn $ newMapDyn f x --TODO: (>>), fail
891− {-# INLINE (>>) #-}
892− _ >> y = y
893− {-# INLINE fail #-}
894− 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)
1235+buildDynamic readV0 v' = do
1236+ result <- liftIO $ newIORef $ BuildDyn (readV0, v')
1237+ let !d = Dyn result
1238+ defer $ SomeDynInit d
1239+ return d
8951240
896−newtype Dyn x p a = Dyn { unDyn :: IORef (Either (BehaviorM x a, Event x (p a)) (Hold x p a)) }
897−
898−unsafeDyn :: BehaviorM x a -> Event x (p a) -> Dyn x p a
899−unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
900− where x = (readV0, v')
901−
902−newJoinDyn :: Dynamic x Identity (Dynamic x Identity a) -> Dyn x Identity a
903−newJoinDyn d =
904− let readV0 = readBehaviorTracked . current =<< readBehaviorTracked (current d)
905− eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . current . runIdentity) $ updated d
906− eInner = switch $ updated <$> current d
907− eBoth = coincidence $ updated . runIdentity <$> updated d
908− v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
909− in unsafeDyn readV0 v'
910−
911−--type role Behavior representational
912−data Behavior x a
913− = forall p. BehaviorHold !(Hold x p a)
914− | BehaviorHoldIdentity !(Hold x Identity a)
915− | BehaviorConst !a
916− | BehaviorPull !(Pull x a)
917− | BehaviorDynIdentity !(Dyn x Identity a)
918− | forall p. R.Patch p => BehaviorDyn !(Dyn x p a)
1241+unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1242+unsafeBuildDynamic readV0 v' =
1243+ Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
9191244
9201245-- ResultM can read behaviors and events
9211246type ResultM = EventM
9221247
923−{-# NOINLINE unsafeNewIORef #-}
924−unsafeNewIORef :: a -> b -> IORef b
925−unsafeNewIORef _ b = unsafePerformIO $ newIORef b
926−
927−instance Functor (Event x) where
1248+instance HasSpiderTimeline x => Functor (Event x) where
9281249 fmap f = push $ return . Just . f
9291250
9301251instance Functor (Behavior x) where
9311252 fmap f = pull . fmap f . readBehaviorTracked
9321253
933−{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
934−push :: (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
935−push f e = eventPush $ Push
936− { pushCompute = f
937− , pushParent = e
938− , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
939− }
940−-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
1254+{-# INLINE push #-}
1255+push :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
1256+push f e = cacheEvent (pushCheap f e)
9411257
942−{-# NOINLINE pull #-}
1258+{-# INLINABLE pull #-}
9431259pull :: BehaviorM x a -> Behavior x a
944−pull a = BehaviorPull $ Pull
945− { pullCompute = a
946− , pullValue = unsafeNewIORef a Nothing
1260+pull a = unsafePerformIO $ do
1261+ ref <- newIORef Nothing
9471262#ifdef DEBUG_NODEIDS
948− , pullNodeId = unsafeNodeId a
1263+ nid <- newNodeId
9491264#endif
950− }
951−
952−{-# NOINLINE switch #-}
953−switch :: Behavior x (Event x a) -> Event x a
954−switch a = eventSwitch $ Switch
955− { switchParent = a
956− , switchSubscribed = unsafeNewIORef a Nothing
957− }
1265+ pure $ behaviorPull $ Pull
1266+ { pullCompute = a
1267+ , pullValue = ref
1268+#ifdef DEBUG_NODEIDS
1269+ , pullNodeId = nid
1270+#endif
1271+ }
9581272
959−coincidence :: Event x (Event x a) -> Event x a
960−coincidence a = eventCoincidence $ Coincidence
961− { coincidenceParent = a
962− , coincidenceSubscribed = unsafeNewIORef a Nothing
963− }
1273+{-# INLINABLE switch #-}
1274+switch :: HasSpiderTimeline x => Behavior x (Event x a) -> Event x a
1275+switch a = unsafePerformIO $ do
1276+ ref <- newIORef Nothing
1277+ pure $ eventSwitch $ Switch
1278+ { switchParent = a
1279+ , switchSubscribed = ref
1280+ }
9641281
965−propagateAndUpdateSubscribersRef :: SubscriberList x a -> a -> EventM x ()
966−propagateAndUpdateSubscribersRef subscribersRef a = do
967− propagate a subscribersRef
1282+coincidence :: HasSpiderTimeline x => Event x (Event x a) -> Event x a
1283+coincidence a = unsafePerformIO $ do
1284+ ref <- newIORef Nothing
1285+ pure $ eventCoincidence $ Coincidence
1286+ { coincidenceParent = a
1287+ , coincidenceSubscribed = ref
1288+ }
9681289
9691290-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
970−run :: [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
1291+run :: forall x b. HasSpiderTimeline x => [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
9711292run roots after = do
972− tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
973− spiderEnv <- SpiderHost ask
974− result <- SpiderHost $ lift $ withMVar (_spiderEnv_lock spiderEnv) $ \_ -> flip runReaderT spiderEnv $ unSpiderHost $ runFrame $ do
1293+ tracePropagate (Proxy :: Proxy x) $ "Running an event frame with " <> show (length roots) <> " events"
1294+ let t = spiderTimeline :: SpiderTimelineEnv x
1295+ result <- SpiderHost $ withMVar (_spiderTimeline_lock (unSTE t)) $ \_ -> unSpiderHost $ runFrame $ do
9751296 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
9761297 occBefore <- liftIO $ do
9771298 occBefore <- readIORef occRef
@@ -982,43 +1303,40 @@ run roots after = do
9821303 return $ Just r
9831304 else return Nothing
9841305 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
985− propagateAndUpdateSubscribersRef subscribersRef a
986− delayedRef <- EventM $ asks eventEnvDelayedMerges
1306+ propagate a subscribersRef
1307+ delayedRef <- asksEventEnv eventEnvDelayedMerges
9871308 let go = do
9881309 delayed <- liftIO $ readIORef delayedRef
9891310 case IntMap.minViewWithKey delayed of
9901311 Nothing -> return ()
9911312 Just ((currentHeight, cur), future) -> do
992− tracePropagate $ "Running height " ++ show currentHeight
1313+ tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
9931314 putCurrentHeight $ Height currentHeight
9941315 liftIO $ writeIORef delayedRef $! future
995− forM_ cur $ \d -> case d of
996− DelayedMerge subscribed -> do
997− height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
998− case height `compare` Height currentHeight of
999− LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1000− GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1001− EQ -> do
1002− m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
1003− liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! DMap.empty
1004− --TODO: Assert that m is not empty
1005− liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $ Just m
1006− scheduleClear $ mergeSubscribedOccurrence subscribed
1007− propagateAndUpdateSubscribersRef (mergeSubscribedSubscribers subscribed) m
1316+ sequence_ cur
10081317 go
10091318 go
10101319 putCurrentHeight maxBound
10111320 after
1012− tracePropagate "Done running an event frame"
1321+ tracePropagate (Proxy :: Proxy x) "Done running an event frame"
10131322 return result
10141323
1015−data SomeClear = forall a. SomeClear (IORef (Maybe a))
1324+scheduleMerge' :: HasSpiderTimeline x => Height -> IORef Height -> EventM x () -> EventM x ()
1325+scheduleMerge' initialHeight heightRef a = scheduleMerge initialHeight $ do
1326+ height <- liftIO $ readIORef heightRef
1327+ currentHeight <- getCurrentHeight
1328+ case height `compare` currentHeight of
1329+ LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1330+ GT -> scheduleMerge' height heightRef a -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1331+ EQ -> a
10161332
1017−data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1333+newtype Clear a = Clear (IORef (Maybe a))
10181334
1019−data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
1335+newtype IntClear a = IntClear (IORef (IntMap a))
10201336
1021−data DelayedMerge x = forall k. DelayedMerge (MergeSubscribed x k)
1337+newtype RootClear k = RootClear (IORef (DMap k Identity))
1338+
1339+data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
10221340
10231341debugFinalize :: Bool
10241342debugFinalize = False
@@ -1028,54 +1346,106 @@ mkWeakPtrWithDebug x debugNote = do
10281346 x' <- evaluate x
10291347 mkWeakPtr x' $
10301348 if debugFinalize
1031− then Just $ putStrLn $ "finalizing: " ++ debugNote
1349+ then Just $ debugStrLn $ "finalizing: " ++ debugNote
10321350 else Nothing
10331351
10341352type WeakList a = [Weak a]
10351353
1036−{-# INLINE withIncreasedDepth #-}
1354+type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
1355+
1356+
1357+
1358+
10371359#ifdef DEBUG
1038−withIncreasedDepth :: CanTrace x m => m a -> m a
1039−withIncreasedDepth a = do
1040− spiderEnv <- askSpiderEnv
1041− liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) succ
1360+
1361+debugSubscriber :: forall x a. HasSpiderTimeline x => String -> Subscriber x a -> IO (Subscriber x a)
1362+debugSubscriber description = return . debugSubscriber' description
1363+
1364+debugSubscriber' :: forall x a. HasSpiderTimeline x => String -> Subscriber x a -> Subscriber x a
1365+debugSubscriber' description subscribed = Subscriber
1366+ {
1367+ subscriberPropagate = \m -> do
1368+ tracePropagate (Proxy :: Proxy x) ("subscriberPropagate: " <> description)
1369+ subscriberPropagate subscribed m
1370+ , subscriberInvalidateHeight = \old -> do
1371+ traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", old = " <> show (unHeight old)
1372+ subscriberInvalidateHeight subscribed old
1373+ traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", done"
1374+ , subscriberRecalculateHeight = \new -> do
1375+ traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", new = " <> show (unHeight new)
1376+ subscriberRecalculateHeight subscribed new
1377+ traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", done"
1378+ }
1379+
1380+
1381+{-# INLINE withIncreasedDepth #-}
1382+withIncreasedDepth :: forall proxy x m a. CanTrace x m => proxy x -> m a -> m a
1383+withIncreasedDepth _ a = do
1384+ liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) succ
10421385 result <- a
1043− liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) pred
1386+ liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
10441387 return result
1045−#else
1046−withIncreasedDepth :: m a -> m a
1047−withIncreasedDepth = id
1048−#endif
1049−
1050−type CanTrace x m = (HasSpiderEnv x m, MonadIO m)
10511388
10521389{-# INLINE tracePropagate #-}
1053−tracePropagate :: (CanTrace x m) => String -> m ()
1054−tracePropagate = traceWhen debugPropagate
1055−
1056−{-# INLINE traceSubscribe #-}
1057−traceSubscribe :: String -> IO ()
1058−traceSubscribe = when debugSubscribe . liftIO . putStrLn
1390+tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1391+tracePropagate p = when debugPropagate . trace p
10591392
10601393{-# INLINE traceInvalidate #-}
10611394traceInvalidate :: String -> IO ()
1062−traceInvalidate = when debugInvalidate . liftIO . putStrLn
1395+traceInvalidate = when debugInvalidate . liftIO . debugStrLn
1396+
1397+{-# INLINE traceInvalidateHeight #-}
1398+traceInvalidateHeight :: String -> IO ()
1399+traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
10631400
1064−{-# INLINE traceWhen #-}
1065−traceWhen :: (CanTrace x m) => Bool -> String -> m ()
1066−traceWhen b message = traceMWhen b $ return message
1401+{-# INLINE trace #-}
1402+trace :: (CanTrace x m) => proxy x -> String -> m ()
1403+trace p message = traceM p $ return message
10671404
1068−{-# INLINE traceMWhen #-}
1069−traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
1070−traceMWhen b getMessage = when b $ do
1405+{-# INLINE traceM #-}
1406+traceM :: forall x proxy m. (CanTrace x m) => proxy x -> m String -> m ()
1407+traceM _ getMessage = do
10711408 message <- getMessage
1072−#ifdef DEBUG
1073− spiderEnv <- askSpiderEnv
1074− d <- liftIO $ readIORef $ _spiderEnv_depth spiderEnv
1409+ d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1410+ liftIO $ debugStrLn $ replicate d ' ' <> message
1411+
10751412#else
1076− let d = 0
1413+
1414+{-# INLINE withIncreasedDepth #-}
1415+withIncreasedDepth :: proxy x -> m a -> m a
1416+withIncreasedDepth _ = id
1417+
1418+{-# INLINE tracePropagate #-}
1419+tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420+tracePropagate _ _ = return ()
1421+
1422+{-# INLINE traceInvalidate #-}
1423+traceInvalidate :: String -> IO ()
1424+traceInvalidate _ = return ()
1425+
1426+{-# INLINE traceInvalidateHeight #-}
1427+traceInvalidateHeight :: String -> IO ()
1428+traceInvalidateHeight _ = return ()
1429+
1430+{-# INLINE debugSubscriber #-}
1431+debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
1432+debugSubscriber _ = return
1433+
1434+{-# INLINE debugSubscriber' #-}
1435+debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436+debugSubscriber' _ = id
1437+
1438+
1439+
1440+{-# INLINE trace #-}
1441+trace :: (CanTrace x m) => proxy x -> String -> m ()
1442+trace _ _ = return ()
1443+
1444+{-# INLINE traceM #-}
1445+traceM :: (CanTrace x m) => proxy x -> m String -> m ()
1446+traceM _ _ = return ()
1447+
10771448#endif
1078− liftIO $ putStrLn $ replicate d ' ' <> message
10791449
10801450whoCreatedIORef :: IORef a -> IO [String]
10811451whoCreatedIORef (IORef a) = whoCreated $! a
@@ -1090,432 +1460,278 @@ groupByHead = \case
10901460 | otherwise -> (x, xs :| []) : l
10911461
10921462listsToForest :: Eq a => [[a]] -> Forest a
1093−listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1463+listsToForest lists = buildForest <$> groupByHead (mapMaybe nonEmpty lists)
1464+ where buildForest (a, lists') = Node a $ listsToForest $ toList lists'
1465+
1466+showStacks :: [[String]] -> String
1467+showStacks = drawForest . listsToForest . fmap (filterStack "Reflex.Spider.Internal")
1468+
1469+filterStack :: String -> [String] -> [String]
1470+#ifdef DEBUG_HIDE_INTERNALS
1471+filterStack prefix = filter (not . (prefix `isPrefixOf`))
1472+#else
1473+filterStack prefix = id
1474+#endif
1475+
1476+#ifdef DEBUG_CYCLES
1477+
1478+data EventLoopException = EventLoopException [[String]]
1479+instance Exception EventLoopException
1480+
1481+instance Show EventLoopException where
1482+ show (EventLoopException stacks) = "causality loop detected:\n" <> if null stacks
1483+ then "no location information, compile with profiling enabled for stack tree"
1484+ else showStacks stacks
1485+
1486+#else
1487+
1488+data EventLoopException = EventLoopException
1489+instance Exception EventLoopException
1490+
1491+instance Show EventLoopException where
1492+ show EventLoopException = "causality loop detected: \n" <>
1493+ "compile reflex with flag 'debug-cycles' and compile with profiling enabled for stack tree"
1494+
1495+#endif
10941496
1095−-- | Propagate everything at the current height
1096−propagate :: a -> SubscriberList x a -> EventM x ()
1097−propagate a subscribers = withIncreasedDepth $ do
1098− -- 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
1099− --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
1100− WeakBag.traverse subscribers $ \s -> case s of
1101− SubscriberPush compute subscribed -> {-# SCC "traversePush" #-} do
1102− tracePropagate $ "SubscriberPush" <> showNodeId subscribed
1103− occ <- runComputeM $ compute a
1104− case occ of
1105− Nothing -> return () -- No need to write a Nothing back into the Ref
1106− Just o -> do
1107− liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
1108− scheduleClear $ pushSubscribedOccurrence subscribed
1109− propagate o $ pushSubscribedSubscribers subscribed
1110− SubscriberMerge k subscribed -> {-# SCC "traverseMerge" #-} do
1111− tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
1112− oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
1113− let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
1114− tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
1115− liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
1116− when (DMap.null oldM) $ do -- Only schedule the firing once
1117− height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
1118− --TODO: assertions about height
1119− currentHeight <- getCurrentHeight
1120− when (height <= currentHeight) $ do
1121− myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
1122− if height /= invalidHeight
1123− then error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1124− else liftIO $ do
1125− nodesInvolvedInCycle <- walkInvalidHeightParents $ EventSubscribedMerge subscribed
1126− stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
1127− error $ "Causality loop found:\n" <> drawForest (listsToForest stacks)
1128− scheduleMerge height subscribed
1129− SubscriberMergeChange subscribed -> {-# SCC "traverseMergeChange" #-} do
1130− tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
1131− defer $ SomeMergeUpdate a subscribed
1132− SubscriberFan subscribed -> {-# SCC "traverseFan" #-} do
1133− subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
1134− tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
1135− --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
1136− forM_ (DMap.toList a) $ \(k :=> Identity v) -> {-# SCC "SubscriberFan" #-} case DMap.lookup k subs of
1137− Nothing -> do
1138− tracePropagate "No subscriber for key"
1139− return ()
1140− Just subsubs -> do
1141− propagate v $ _fanSubscribedChildren_list subsubs
1142− return ()
1143− SubscriberHold h -> {-# SCC "traverseHold" #-} propagateSubscriberHold h a
1144− SubscriberHoldIdentity h -> {-# SCC "traverseHoldIdentity" #-} propagateSubscriberHold h a
1145− SubscriberSwitch subscribed -> {-# SCC "traverseSwitch" #-} do
1146− tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
1147− liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
1148− scheduleClear $ switchSubscribedOccurrence subscribed
1149− propagate a $ switchSubscribedSubscribers subscribed
1150− SubscriberCoincidenceOuter subscribed -> {-# SCC "traverseCoincidenceOuter" #-} do
1151− tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
1152− outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
1153− tracePropagate $ " outerHeight = " <> show outerHeight
1154− (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
1155− tracePropagate $ " isJust occ = " <> show (isJust occ)
1156− tracePropagate $ " innerHeight = " <> show innerHeight
1157− liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
1158− scheduleClear $ coincidenceSubscribedInnerParent subscribed
1159− case occ of
1160− Nothing -> do
1161− when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
1162− writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
1163− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
1164− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
1165− Just o -> do -- Since it's already firing, no need to adjust height
1166− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
1167− scheduleClear $ coincidenceSubscribedOccurrence subscribed
1168− propagate o $ coincidenceSubscribedSubscribers subscribed
1169− SubscriberCoincidenceInner subscribed -> {-# SCC "traverseCoincidenceInner" #-} do
1170− tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
1171− occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
1172− case occ of
1173− Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
1174− Nothing -> do
1175− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
1176− scheduleClear $ coincidenceSubscribedOccurrence subscribed
1177− propagate a $ coincidenceSubscribedSubscribers subscribed
1178− SubscriberHandle -> {-# SCC "traverseHandle" #-} tracePropagate "SubscriberHandle"
11791497
11801498{-# INLINE propagateSubscriberHold #-}
1181−propagateSubscriberHold :: R.Patch p => Hold x p a -> p a -> EventM x ()
1499+propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
11821500propagateSubscriberHold h a = do
1183− {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
1501+ {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
11841502 invalidators <- liftIO $ readIORef $ holdInvalidators h
11851503 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504+
11861505 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1187− case {-# SCC "apply" #-} R.apply a v of
1506+ case {-# SCC "apply" #-} apply a v of
11881507 Nothing -> return ()
11891508 Just v' -> do
1190− {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
1509+ {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510+ tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
11911511 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
11921512 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
11931513 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
11941514
1195−data SomeResetCoincidence x = forall a. SomeResetCoincidence !(EventSubscription x a) !(Maybe (CoincidenceSubscribed x a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1196−
1197−{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> BehaviorM x a #-}
1198−{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> EventM x a #-}
1199−readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
1200−readBehaviorUntracked b = do
1201− holdInits <- getDeferralQueue
1202− liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
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
12031516
12041517runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1205−runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
1518+runBehaviorM a mwi holdInits = runReaderIO (unBehaviorM a) (mwi, holdInits)
12061519
12071520askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
12081521askInvalidator = do
1209− (!m, _) <- BehaviorM ask
1522+ (!m, _) <- ask
12101523 case m of
12111524 Nothing -> return Nothing
12121525 Just (!wi, _) -> return $ Just wi
12131526
12141527askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
12151528askParentsRef = do
1216− (!m, _) <- BehaviorM ask
1529+ (!m, _) <- ask
12171530 case m of
12181531 Nothing -> return Nothing
1219− Just (_, !p) -> return $ Just p
1220−
1221−askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1222−askBehaviorHoldInits = do
1223− (_, !his) <- BehaviorM ask
1224− return his
1225−
1226−readBehaviorTracked :: Behavior x a -> BehaviorM x a
1227−readBehaviorTracked b = case b of
1228− BehaviorHold h -> readHoldTracked h
1229− BehaviorHoldIdentity h -> readHoldTracked h
1230− BehaviorConst a -> return a
1231− BehaviorPull p -> do
1232− val <- liftIO $ readIORef $ pullValue p
1233− case val of
1234− Just subscribed -> do
1235− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1236− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
1237− liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
1238− return $ pullSubscribedValue subscribed
1239− Nothing -> do
1240− i <- liftIO $ newInvalidatorPull p
1241− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
1242− parentsRef <- liftIO $ newIORef []
1243− holdInits <- askBehaviorHoldInits
1244− a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
1245− invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
1246− parents <- liftIO $ readIORef parentsRef
1247− let subscribed = PullSubscribed
1248− { pullSubscribedValue = a
1249− , pullSubscribedInvalidators = invsRef
1250− , pullSubscribedOwnInvalidator = i
1251− , pullSubscribedParents = parents
1252− }
1253− liftIO $ writeIORef (pullValue p) $ Just subscribed
1254− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1255− return a
1256− BehaviorDyn d -> readHoldTracked =<< getDynHold d
1257− BehaviorDynIdentity d -> readHoldTracked =<< getDynHold d
1258−
1259−{-# INLINE readHoldTracked #-}
1260−readHoldTracked :: Hold x p a -> BehaviorM x a
1261−readHoldTracked h = do
1262− result <- liftIO $ readIORef $ holdValue h
1263− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
1264− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
1265− return result
1532+ Just (_, !p) -> return $ Just p
1533+
1534+askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1535+askBehaviorHoldInits = do
1536+ (_, !his) <- ask
1537+ return his
12661538
12671539{-# INLINE getDynHold #-}
1268−getDynHold :: (Defer (SomeHoldInit x) m, R.Patch p) => Dyn x p a -> m (Hold x p a)
1540+getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
12691541getDynHold d = do
12701542 mh <- liftIO $ readIORef $ unDyn d
12711543 case mh of
1272− Right h -> return h
1273− Left (readV0, v') -> do
1544+ HoldDyn h -> return h
1545+ UnsafeDyn (readV0, v') -> do
12741546 holdInits <- getDeferralQueue
12751547 v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1548+ hold' v0 v'
1549+ BuildDyn (readV0, v') -> do
1550+ v0 <- liftIO $ runEventM readV0
1551+ hold' v0 v'
1552+ where
1553+ hold' v0 v' = do
12761554 h <- hold v0 v'
1277− liftIO $ writeIORef (unDyn d) $ Right h
1555+ liftIO $ writeIORef (unDyn d) $ HoldDyn h
12781556 return h
12791557
1280−readRootSubscribed :: RootSubscribed x a -> IO (Maybe a)
1281−readRootSubscribed = rootSubscribedOccurrence
1282−
1283−readPushSubscribed :: PushSubscribed x b a -> IO (Maybe a)
1284−readPushSubscribed subscribed = do
1285− result <- readIORef $ pushSubscribedOccurrence subscribed -- Since ResultM is always called after the final height is reached, this will always be valid
1286− touch $ pushSubscribedSelf subscribed
1287− return result
1288−
1289−readMergeSubscribed :: MergeSubscribed x k -> IO (Maybe (DMap k Identity))
1290−readMergeSubscribed subscribed = do
1291− result <- readIORef $ mergeSubscribedOccurrence subscribed
1292− touch $ mergeSubscribedParents subscribed
1293− return result
1294−
1295−readFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> IO (Maybe a)
1296−readFanSubscribed k fs = do
1297− parentOcc <- readEventSubscribed $ _eventSubscription_subscribed $ fanSubscribedParent fs
1298− return $ coerce $ DMap.lookup k =<< parentOcc
1299−
1300−readSwitchSubscribed :: SwitchSubscribed x a -> IO (Maybe a)
1301−readSwitchSubscribed subscribed = do
1302− result <- readIORef $ switchSubscribedOccurrence subscribed
1303− touch $ switchSubscribedOwnInvalidator subscribed
1304− return result
1305−
1306−readCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO (Maybe a)
1307−readCoincidenceSubscribed subscribed = do
1308− result <- readIORef $ coincidenceSubscribedOccurrence subscribed
1309− touch $ coincidenceSubscribedOuter subscribed
1310− --TODO: do we need to touch the inner subscriber?
1311− return result
13121558
13131559-- Always refers to 0
13141560{-# NOINLINE zeroRef #-}
13151561zeroRef :: IORef Height
13161562zeroRef = unsafePerformIO $ newIORef zeroHeight
13171563
1318−{-# INLINE subscribeHoldEvent #-}
1319−subscribeHoldEvent :: (CanSubscribe x m, R.Patch p) => Hold x p a -> Subscriber x (p a) -> m (EventSubscription x (p a))
1320−subscribeHoldEvent h sub = do
1321− EventSubscription _ subd <- getHoldEventSubscription h
1322− sln <- liftIO $ subscribeEventSubscribed subd sub
1323− return $ EventSubscription sln subd
1324−
1325−{-# INLINE debugSubscribe #-}
1326−debugSubscribe :: Bool
1327−debugSubscribe = False
1328−
1329−
1330−type CanSubscribe x m =
1331− ( HasSpiderEnv x m
1332− , HasCurrentHeight x m
1333− , Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m -- The things we need to lazily initialize state
1334− , Defer SomeClear m -- Wiping out event firings
1335− , Defer (SomeAssignment x) m -- Updating state
1336− , Defer (SomeResetCoincidence x) m
1337− , m ~ EventM x
1338− )
1339−
1340−getRootSubscribed :: GCompare k => k a -> Root x k -> Subscriber x a -> IO (SubscriberListTicket x a, RootSubscribed x a)
1564+getRootSubscribed :: forall k x a. (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket, RootSubscribed x a, Maybe a)
13411565getRootSubscribed k r sub = do
13421566 mSubscribed <- readIORef $ rootSubscribed r
1567+ let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
13431568 case DMap.lookup k mSubscribed of
13441569 Just subscribed -> {-# SCC "hitRoot" #-} do
13451570 sln <- subscribeRootSubscribed subscribed sub
1346− return (sln, subscribed)
1571+ occ <- getOcc
1572+ return (sln, subscribed, occ)
13471573 Nothing -> {-# SCC "missRoot" #-} do
13481574 weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
13491575 let !cached = rootSubscribed r
13501576 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
13511577 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1352− when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
1578+
1579+ tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580+
13531581 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
13541582 writeIORef uninitRef $! uninit
1355− let subscribed = RootSubscribed
1583+#ifdef DEBUG_NODEIDS
1584+ nid <- newNodeId
1585+#endif
1586+ let !subscribed = RootSubscribed
13561587 { rootSubscribedKey = k
13571588 , rootSubscribedCachedSubscribed = cached
1358− , rootSubscribedOccurrence = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
1589+ , rootSubscribedOccurrence = getOcc
13591590 , rootSubscribedSubscribers = subs
13601591 , rootSubscribedUninit = uninit
13611592 , rootSubscribedWeakSelf = weakSelf
13621593#ifdef DEBUG_NODEIDS
1363− , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
1594+ , rootSubscribedNodeId = nid
13641595#endif
13651596 }
1366− writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
1597+ -- If we die at the same moment that all our children die, they will
1598+ -- try to clean us up but will fail because their Weak reference to us
1599+ -- will also be dead. So, if we are dying, check if there are any
1600+ -- children; since children don't bother cleaning themselves up if
1601+ -- their parents are already dead, I don't think there's a race
1602+ -- condition here. However, if there are any children, then we can
1603+ -- infer that we need to clean ourselves up, so we do.
1604+ finalCleanup = do
1605+ cs <- readIORef $ _weakBag_children subs
1606+ when (not $ IntMap.null cs) (cleanupRootSubscribed subscribed)
1607+ writeIORef weakSelf =<< evaluate =<< mkWeakPtr subscribed (Just finalCleanup)
13671608 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
1368− return (sln, subscribed)
1609+ occ <- getOcc
1610+ return (sln, subscribed, occ)
13691611
1612+#ifdef USE_TEMPLATE_HASKELL
13701613{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1614+#endif
13711615cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1372−cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
1616+cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
13731617 rootSubscribedUninit self
13741618 modifyIORef' cached $ DMap.delete k
13751619
13761620{-# INLINE subscribeRootSubscribed #-}
1377−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO (SubscriberListTicket x a)
1621+subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
13781622subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
13791623
1380−-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1381−{-# SPECIALIZE getPushSubscribed :: Push x a b -> Subscriber x b -> EventM x (SubscriberListTicket x b, PushSubscribed x a b) #-}
1382−getPushSubscribed :: CanSubscribe x m => Push x a b -> Subscriber x b -> m (SubscriberListTicket x b, PushSubscribed x a b)
1383−getPushSubscribed p sub = do
1384− mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1385− case mSubscribed of
1386− Just subscribed -> {-# SCC "hitPush" #-} do
1387− sln <- liftIO $ subscribePushSubscribed subscribed sub
1388− return (sln, subscribed)
1389− Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1390− subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1391− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1392− s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
1393− subscription@(EventSubscription _ subd) <- subscribe (pushParent p) s
1394− parentOcc <- liftIO $ readEventSubscribed subd
1395− occ <- runComputeM $ join <$> mapM (pushCompute p) parentOcc
1396− occRef <- liftIO $ newIORef occ
1397− when (isJust occ) $ scheduleClear occRef
1398− weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1399− let !cached = pushSubscribed p
1400− (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1401− let subscribed = PushSubscribed
1402− { pushSubscribedCachedSubscribed = cached
1403− , pushSubscribedOccurrence = occRef
1404− , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1405− , pushSubscribedSubscribers = subs
1406− , pushSubscribedSelf = s
1407− , pushSubscribedWeakSelf = weakSelf
1408− , pushSubscribedParent = subscription
1624+newtype EventSelectorInt x a = EventSelectorInt { selectInt :: Int -> Event x a }
1625+
1626+data FanInt x a = FanInt
1627+ { _fanInt_subscribers :: {-# UNPACK #-} !(FastMutableIntMap (FastWeakBag (Subscriber x a))) --TODO: Clean up the keys in here when their child weak bags get empty --TODO: Remove our own subscription when the subscribers list is completely empty
1628+ , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
1629+ , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
14091630#ifdef DEBUG_NODEIDS
1410− , pushSubscribedNodeId = unsafeNodeId p
1631+ , _fanInt_nodeId :: {-# UNPACK #-} !Int
14111632#endif
1412− }
1413− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1414− liftIO $ writeIORef subscribedRef $! subscribed
1415− liftIO $ writeIORef (pushSubscribed p) $ Just subscribed
1416− return (sln, subscribed)
1417−
1418−cleanupPushSubscribed :: PushSubscribed x a b -> IO ()
1419−cleanupPushSubscribed self = do
1420− unsubscribe $ pushSubscribedParent self
1421− writeIORef (pushSubscribedCachedSubscribed self) $ Nothing
1422−
1423−{-# INLINE subscribePushSubscribed #-}
1424−subscribePushSubscribed :: PushSubscribed x a b -> Subscriber x b -> IO (SubscriberListTicket x b)
1425−subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1426−
1427−{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge x k -> Subscriber x (DMap k Identity) -> EventM x (SubscriberListTicket x (DMap k Identity), MergeSubscribed x k) #-}
1428−getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge x k -> Subscriber x (DMap k Identity) -> m (SubscriberListTicket x (DMap k Identity), MergeSubscribed x k)
1429−getMergeSubscribed m sub = do
1430− mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1431− case mSubscribed of
1432− Just subscribed -> {-# SCC "hitMerge" #-} do
1433− sln <- liftIO $ subscribeMergeSubscribed subscribed sub
1434− return (sln, subscribed)
1435− Nothing -> {-# SCC "missMerge" #-} do
1436− subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1437− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1438− initialParents <- readBehaviorUntracked $ current $ mergeParents m
1439− subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent x k))] <- forM (DMap.toList initialParents) $ {-# SCC "getMergeSubscribed.a" #-} \(k :=> e) -> do
1440− s <- {-# SCC "getMergeSubscribed.a.1" #-} liftIO $ newSubscriberMerge k subscribedUnsafe
1441− subscription@(EventSubscription _ parentSubd) <- {-# SCC "getMergeSubscribed.a.2" #-} subscribe e s
1442− parentOcc <- {-# SCC "getMergeSubscribed.a.3" #-} liftIO $ readEventSubscribed parentSubd
1443− height <- {-# SCC "getMergeSubscribed.a.4" #-} liftIO $ getEventSubscribedHeight parentSubd
1444− {-# SCC "getMergeSubscribed.a.5" #-} return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription s)
1445− let dm = DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1446− heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1447− myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1448− myHeight = if invalidHeight `elem` heights
1449− then invalidHeight
1450− else succHeight $ heightBagMax myHeightBag
1451− currentHeight <- getCurrentHeight
1452− let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1453− then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1454− else (Nothing, dm)
1455− unless (DMap.null accum) $ do
1456− scheduleMerge myHeight subscribedUnsafe
1457− occRef <- liftIO $ newIORef occ
1458− when (isJust occ) $ scheduleClear occRef
1459− accumRef <- liftIO $ newIORef accum
1460− heightRef <- liftIO $ newIORef myHeight
1461− heightMapRef <- liftIO $ newIORef myHeightBag
1462− weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1463− (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1464− changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1465− parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1466− let !subscribed = MergeSubscribed
1467− { mergeSubscribedCachedSubscribed = mergeSubscribed m
1468− , mergeSubscribedOccurrence = occRef
1469− , mergeSubscribedAccum = accumRef
1470− , mergeSubscribedHeight = heightRef
1471− , mergeSubscribedHeightBag = heightMapRef
1472− , mergeSubscribedSubscribers = subs
1473− , mergeSubscribedChange = changeSubdRef
1474− , mergeSubscribedParents = parentsRef
1475− , mergeSubscribedWeakSelf = weakSelf
1633+ }
1634+
1635+newFanInt :: IO (FanInt x a)
1636+newFanInt = do
1637+ subscribers <- FastMutableIntMap.newEmpty --TODO: Clean up the keys in here when their child weak bags get empty --TODO: Remove our own subscription when the subscribers list is completely empty
1638+ subscriptionRef <- newIORef $ error "fanInt: no subscription"
1639+ occRef <- newIORef $ error "fanInt: no occurrence"
14761640#ifdef DEBUG_NODEIDS
1477− , mergeSubscribedNodeId = unsafeNodeId m
1641+ nodeId <- newNodeId
14781642#endif
1479− }
1480− defer $ SomeMergeInit subscribed $ updated $ mergeParents m
1481− liftIO $ writeIORef subscribedRef $! subscribed
1482− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1483− liftIO $ writeIORef (mergeSubscribed m) $ Just subscribed
1484− return (sln, subscribed)
1485−
1486−cleanupMergeSubscribed :: MergeSubscribed x k -> IO ()
1487−cleanupMergeSubscribed subscribed = do
1488− parents <- readIORef $ mergeSubscribedParents subscribed
1489− forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1490− -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1491− writeIORef (mergeSubscribedCachedSubscribed subscribed) $ Nothing -- Get rid of the cached subscribed
1492−
1493−{-# INLINE subscribeMergeSubscribed #-}
1494−subscribeMergeSubscribed :: MergeSubscribed x k -> Subscriber x (DMap k Identity) -> IO (SubscriberListTicket x (DMap k Identity))
1495−subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
1496−
1497−{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan x k -> Subscriber x a -> EventM x (SubscriberListTicket x a, FanSubscribed x k) #-}
1498−getFanSubscribed :: (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderEnv x m, m ~ EventM x, GCompare k) => k a -> Fan x k -> Subscriber x a -> m (SubscriberListTicket x a, FanSubscribed x k)
1643+ return $ FanInt
1644+ { _fanInt_subscribers = subscribers
1645+ , _fanInt_subscriptionRef = subscriptionRef
1646+ , _fanInt_occRef = occRef
1647+#ifdef DEBUG_NODEIDS
1648+ , _fanInt_nodeId = nodeId
1649+#endif
1650+ }
1651+
1652+fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
1653+fanInt p = unsafePerformIO $ do
1654+ self <- newFanInt
1655+ pure $ EventSelectorInt $ \k -> Event $ \sub -> do
1656+ isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
1657+ when isEmpty $ do -- This is the first subscriber, so we need to subscribe to our input
1658+ let desc = "fanInt" <> showNodeId self <> ", k = " <> show k
1659+ (subscription, parentOcc) <- subscribeAndRead p $ debugSubscriber' desc $ Subscriber
1660+ { subscriberPropagate = \m -> do
1661+ liftIO $ writeIORef (_fanInt_occRef self) m
1662+ scheduleIntClear $ _fanInt_occRef self
1663+ FastMutableIntMap.forIntersectionWithImmutable_ (_fanInt_subscribers self) m $ \b v -> --TODO: Do we need to know that no subscribers are being added as we traverse?
1664+ FastWeakBag.traverse_ b $ \s ->
1665+ subscriberPropagate s v
1666+ , subscriberInvalidateHeight = \old ->
1667+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1668+ FastWeakBag.traverse_ b $ \s ->
1669+ subscriberInvalidateHeight s old
1670+ , subscriberRecalculateHeight = \new ->
1671+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1672+ FastWeakBag.traverse_ b $ \s ->
1673+ subscriberRecalculateHeight s new
1674+ }
1675+ liftIO $ do
1676+ writeIORef (_fanInt_subscriptionRef self) subscription
1677+ writeIORef (_fanInt_occRef self) $ fromMaybe IntMap.empty parentOcc
1678+ scheduleIntClear $ _fanInt_occRef self
1679+ liftIO $ do
1680+ b <- FastMutableIntMap.lookup (_fanInt_subscribers self) k >>= \case
1681+ Nothing -> do
1682+ b <- FastWeakBag.empty
1683+ FastMutableIntMap.insert (_fanInt_subscribers self) k b
1684+ return b
1685+ Just b -> return b
1686+ ticket <- liftIO $ FastWeakBag.insert sub b
1687+ currentOcc <- readIORef (_fanInt_occRef self)
1688+
1689+ subscribed <- fanIntSubscribed ticket self
1690+ return (EventSubscription (FastWeakBag.remove ticket) subscribed, IntMap.lookup k currentOcc)
1691+
1692+fanIntSubscribed :: FastWeakBagTicket k -> FanInt x a -> IO (EventSubscribed x)
1693+fanIntSubscribed ticket self = do
1694+ subscribedParent <- _eventSubscription_subscribed <$> readIORef (_fanInt_subscriptionRef self)
1695+ return $ EventSubscribed
1696+ { eventSubscribedHeightRef = eventSubscribedHeightRef subscribedParent
1697+ , eventSubscribedRetained = toAny (_fanInt_subscriptionRef self, ticket)
1698+#ifdef DEBUG_CYCLES
1699+ , eventSubscribedGetParents = return [subscribedParent]
1700+ , eventSubscribedHasOwnHeightRef = False
1701+ , eventSubscribedWhoCreated = whoCreatedIORef $ _fanInt_subscriptionRef self
1702+#endif
1703+ }
1704+
1705+
1706+{-# INLINABLE getFanSubscribed #-}
1707+getFanSubscribed :: (HasSpiderTimeline x, GCompare k) => k a -> Fan x k v -> Subscriber x (v a) -> EventM x (WeakBagTicket, FanSubscribed x k v, Maybe (v a))
14991708getFanSubscribed k f sub = do
15001709 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
15011710 case mSubscribed of
1502− Just subscribed -> {-# SCC "hitFan" #-} do
1503− sln <- liftIO $ subscribeFanSubscribed k subscribed sub
1504− return (sln, subscribed)
1711+ Just subscribed -> {-# SCC "hitFan" #-} liftIO $ do
1712+ sln <- subscribeFanSubscribed k subscribed sub
1713+ occ <- readIORef $ fanSubscribedOccurrence subscribed
1714+ return (sln, subscribed, coerce $ DMap.lookup k =<< occ)
15051715 Nothing -> {-# SCC "missFan" #-} do
15061716 subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
15071717 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
15081718 s <- liftIO $ newSubscriberFan subscribedUnsafe
1509− subscription <- subscribe (fanParent f) s
1719+ (subscription, parentOcc) <- subscribeAndRead (fanParent f) s
15101720 weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
15111721 (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
15121722 subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
1723+ occRef <- liftIO $ newIORef parentOcc
1724+ when (isJust parentOcc) $ scheduleClear occRef
1725+#ifdef DEBUG_NODEIDS
1726+ nid <- liftIO newNodeId
1727+#endif
15131728 let subscribed = FanSubscribed
15141729 { fanSubscribedCachedSubscribed = fanSubscribed f
1730+ , fanSubscribedOccurrence = occRef
15151731 , fanSubscribedParent = subscription
15161732 , fanSubscribedSubscribers = subscribersRef
15171733#ifdef DEBUG_NODEIDS
1518− , fanSubscribedNodeId = unsafeNodeId f
1734+ , fanSubscribedNodeId = nid
15191735#endif
15201736 }
15211737 let !self = (k, subscribed)
@@ -1523,9 +1739,9 @@ getFanSubscribed k f sub = do
15231739 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
15241740 liftIO $ writeIORef subscribedRef $! subscribed
15251741 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1526− return (slnForSub, subscribed)
1742+ return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
15271743
1528−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k) -> IO ()
1744+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
15291745cleanupFanSubscribed (k, subscribed) = do
15301746 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
15311747 let reducedSubscribers = DMap.delete k subscribers
@@ -1537,7 +1753,7 @@ cleanupFanSubscribed (k, subscribed) = do
15371753 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
15381754
15391755{-# INLINE subscribeFanSubscribed #-}
1540−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> Subscriber x a -> IO (SubscriberListTicket x a)
1756+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
15411757subscribeFanSubscribed k subscribed sub = do
15421758 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
15431759 case DMap.lookup k subscribers of
@@ -1545,18 +1761,19 @@ subscribeFanSubscribed k subscribed sub = do
15451761 let !self = (k, subscribed)
15461762 weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
15471763 (list, sln) <- WeakBag.singleton sub weakSelf cleanupFanSubscribed
1548− 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
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
15491765 return sln
15501766 Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
15511767
1552−{-# SPECIALIZE getSwitchSubscribed :: Switch x a -> Subscriber x a -> EventM x (SubscriberListTicket x a, SwitchSubscribed x a) #-}
1553−getSwitchSubscribed :: (Defer (SomeHoldInit x) m, Defer (SomeAssignment x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, Defer (SomeResetCoincidence x) m, HasCurrentHeight x m, HasSpiderEnv x m, m ~ EventM x) => Switch x a -> Subscriber x a -> m (SubscriberListTicket x a, SwitchSubscribed x a)
1768+{-# INLINABLE getSwitchSubscribed #-}
1769+getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
15541770getSwitchSubscribed s sub = do
15551771 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
15561772 case mSubscribed of
1557− Just subscribed -> {-# SCC "hitSwitch" #-} do
1558− sln <- liftIO $ subscribeSwitchSubscribed subscribed sub
1559− return (sln, subscribed)
1773+ Just subscribed -> {-# SCC "hitSwitch" #-} liftIO $ do
1774+ sln <- subscribeSwitchSubscribed subscribed sub
1775+ occ <- readIORef $ switchSubscribedOccurrence subscribed
1776+ return (sln, subscribed, occ)
15601777 Nothing -> {-# SCC "missSwitch" #-} do
15611778 subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
15621779 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
@@ -1567,14 +1784,16 @@ getSwitchSubscribed s sub = do
15671784 parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
15681785 holdInits <- getDeferralQueue
15691786 e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1570− subscription@(EventSubscription _ subd) <- subscribe e mySub
1787+ (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead e mySub
1788+ heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
15711789 subscriptionRef <- liftIO $ newIORef subscription
1572− parentOcc <- liftIO $ readEventSubscribed subd
15731790 occRef <- liftIO $ newIORef parentOcc
15741791 when (isJust parentOcc) $ scheduleClear occRef
1575− heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
15761792 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
15771793 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794+#ifdef DEBUG_NODEIDS
1795+ nid <- liftIO newNodeId
1796+#endif
15781797 let !subscribed = SwitchSubscribed
15791798 { switchSubscribedCachedSubscribed = switchSubscribed s
15801799 , switchSubscribedOccurrence = occRef
@@ -1587,13 +1806,13 @@ getSwitchSubscribed s sub = do
15871806 , switchSubscribedCurrentParent = subscriptionRef
15881807 , switchSubscribedWeakSelf = weakSelf
15891808#ifdef DEBUG_NODEIDS
1590− , switchSubscribedNodeId = unsafeNodeId s
1809+ , switchSubscribedNodeId = nid
15911810#endif
15921811 }
15931812 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
15941813 liftIO $ writeIORef subscribedRef $! subscribed
15951814 liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1596− return (slnForSub, subscribed)
1815+ return (slnForSub, subscribed, parentOcc)
15971816
15981817cleanupSwitchSubscribed :: SwitchSubscribed x a -> IO ()
15991818cleanupSwitchSubscribed subscribed = do
@@ -1602,23 +1821,23 @@ cleanupSwitchSubscribed subscribed = do
16021821 writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
16031822
16041823{-# INLINE subscribeSwitchSubscribed #-}
1605−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO (SubscriberListTicket x a)
1824+subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
16061825subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
16071826
1608−{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence x a -> Subscriber x a -> EventM x (SubscriberListTicket x a, CoincidenceSubscribed x a) #-}
1609−getCoincidenceSubscribed :: forall x a m. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderEnv x m, m ~ EventM x) => Coincidence x a -> Subscriber x a -> m (SubscriberListTicket x a, CoincidenceSubscribed x a)
1827+{-# INLINABLE getCoincidenceSubscribed #-}
1828+getCoincidenceSubscribed :: forall x a. HasSpiderTimeline x => Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
16101829getCoincidenceSubscribed c sub = do
16111830 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
16121831 case mSubscribed of
1613− Just subscribed -> {-# SCC "hitCoincidence" #-} do
1614− sln <- liftIO $ subscribeCoincidenceSubscribed subscribed sub
1615− return (sln, subscribed)
1832+ Just subscribed -> {-# SCC "hitCoincidence" #-} liftIO $ do
1833+ sln <- subscribeCoincidenceSubscribed subscribed sub
1834+ occ <- readIORef $ coincidenceSubscribedOccurrence subscribed
1835+ return (sln, subscribed, occ)
16161836 Nothing -> {-# SCC "missCoincidence" #-} do
16171837 subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
16181838 subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
16191839 subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1620− outerSubscription@(EventSubscription _ outerSubd) <- subscribe (coincidenceParent c) subOuter
1621− outerOcc <- liftIO $ readEventSubscribed outerSubd
1840+ (outerSubscription@(EventSubscription _ outerSubd), outerOcc) <- subscribeAndRead (coincidenceParent c) subOuter
16221841 outerHeight <- liftIO $ getEventSubscribedHeight outerSubd
16231842 (occ, height, mInnerSubd) <- case outerOcc of
16241843 Nothing -> return (Nothing, outerHeight, Nothing)
@@ -1632,6 +1851,9 @@ getCoincidenceSubscribed c sub = do
16321851 scheduleClear innerSubdRef
16331852 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
16341853 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854+#ifdef DEBUG_NODEIDS
1855+ nid <- liftIO newNodeId
1856+#endif
16351857 let subscribed = CoincidenceSubscribed
16361858 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
16371859 , coincidenceSubscribedOccurrence = occRef
@@ -1642,13 +1864,13 @@ getCoincidenceSubscribed c sub = do
16421864 , coincidenceSubscribedInnerParent = innerSubdRef
16431865 , coincidenceSubscribedWeakSelf = weakSelf
16441866#ifdef DEBUG_NODEIDS
1645− , coincidenceSubscribedNodeId = unsafeNodeId c
1867+ , coincidenceSubscribedNodeId = nid
16461868#endif
16471869 }
16481870 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
16491871 liftIO $ writeIORef subscribedRef $! subscribed
16501872 liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1651− return (slnForSub, subscribed)
1873+ return (slnForSub, subscribed, occ)
16521874
16531875cleanupCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO ()
16541876cleanupCoincidenceSubscribed subscribed = do
@@ -1656,146 +1878,535 @@ cleanupCoincidenceSubscribed subscribed = do
16561878 writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
16571879
16581880{-# INLINE subscribeCoincidenceSubscribed #-}
1659−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO (SubscriberListTicket x a)
1881+subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
16601882subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
16611883
1662−{-# INLINE merge #-}
1663−merge :: GCompare k => Dynamic x R.PatchDMap (DMap k (Event x)) -> Event x (DMap k Identity)
1664−merge m = eventMerge $ Merge
1665− { mergeParents = m
1666− , mergeSubscribed = unsafeNewIORef m Nothing
1884+{-# INLINE mergeG #-}
1885+mergeG :: forall k q x v. (HasSpiderTimeline x, GCompare k)
1886+ => (forall a. q a -> Event x (v a))
1887+ -> DynamicS x (PatchDMap k q) -> Event x (DMap k v)
1888+mergeG nt d = cacheEvent (mergeCheap nt d)
1889+
1890+{-# INLINE mergeWithMove #-}
1891+mergeWithMove :: forall k v q x. (HasSpiderTimeline x, GCompare k)
1892+ => (forall a. q a -> Event x (v a))
1893+ -> DynamicS x (PatchDMapWithMove k q) -> Event x (DMap k v)
1894+mergeWithMove nt d = cacheEvent (mergeCheapWithMove nt d)
1895+
1896+{-# INLINE [1] mergeCheap #-}
1897+mergeCheap
1898+ :: forall k x q v. (HasSpiderTimeline x, GCompare k)
1899+ => (forall a. q a -> Event x (v a))
1900+ -> DynamicS x (PatchDMap k q)
1901+ -> Event x (DMap k v)
1902+mergeCheap nt = mergeGCheap' unMergeSubscribedParent getInitialSubscribers updateMe destroy
1903+ where
1904+ updateMe :: MergeUpdateFunc k v x (PatchDMap k q) (MergeSubscribedParent x)
1905+ updateMe subscriber heightBagRef oldParents (PatchDMap p) = do
1906+ let f (subscriptionsToKill, ps) (k :=> ComposeMaybe me) = do
1907+ (mOldSubd, newPs) <- case me of
1908+ Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1909+ Just e -> do
1910+ let s = subscriber $ return k
1911+ subscription@(EventSubscription _ subd) <- subscribe (nt e) s
1912+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
1913+ let newParent = MergeSubscribedParent subscription
1914+ liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
1915+ return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1916+ forM_ mOldSubd $ \oldSubd -> do
1917+ oldHeight <- liftIO $ getEventSubscribedHeight $
1918+ _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
1919+
1920+ liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1921+ return (maybeToList (unMergeSubscribedParent <$> mOldSubd) ++ subscriptionsToKill, newPs)
1922+ foldM f ([], oldParents) $ DMap.toList p
1923+
1924+ getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParent x)
1925+ getInitialSubscribers initialParents subscriber = do
1926+ subscribers <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1927+ let s = subscriber $ return k
1928+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead (nt e) s
1929+ height <- liftIO $ getEventSubscribedHeight parentSubd
1930+ return (fmap (k :=>) parentOcc, height, k :=> MergeSubscribedParent subscription)
1931+ return ( DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1932+ , fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1933+ , DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1934+ )
1935+
1936+ destroy :: MergeDestroyFunc k (MergeSubscribedParent x)
1937+ destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParent sub) -> unsubscribe sub
1938+
1939+{-# INLINE [1] mergeCheapWithMove #-}
1940+mergeCheapWithMove :: forall k x v q. (HasSpiderTimeline x, GCompare k)
1941+ => (forall a. q a -> Event x (v a))
1942+ -> DynamicS x (PatchDMapWithMove k q)
1943+ -> Event x (DMap k v)
1944+mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription getInitialSubscribers updateMe destroy
1945+ where
1946+ updateMe :: MergeUpdateFunc k v x (PatchDMapWithMove k q) (MergeSubscribedParentWithMove x k)
1947+ updateMe subscriber heightBagRef oldParents p = do
1948+ -- Prepare new parents for insertion
1949+ let subscribeParent :: forall a. k a -> Event x (v a) -> EventM x (MergeSubscribedParentWithMove x k a)
1950+ subscribeParent k e = do
1951+ keyRef <- liftIO $ newIORef k
1952+ let s = subscriber $ liftIO $ readIORef keyRef
1953+ subscription@(EventSubscription _ subd) <- subscribe e s
1954+ liftIO $ do
1955+ newParentHeight <- getEventSubscribedHeight subd
1956+ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
1957+ return $ MergeSubscribedParentWithMove subscription keyRef
1958+ p' <- PatchDMapWithMove.traversePatchDMapWithMoveWithKey (\k q -> subscribeParent k (nt q)) p
1959+ -- Collect old parents for deletion and update the keys of moved parents
1960+ let moveOrDelete :: forall a. k a -> PatchDMapWithMove.NodeInfo k q a -> MergeSubscribedParentWithMove x k a -> Constant (EventM x (Maybe (EventSubscription x))) a
1961+ moveOrDelete _ ni parent = Constant $ case getComposeMaybe $ PatchDMapWithMove._nodeInfo_to ni of
1962+ Nothing -> do
1963+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
1964+ _mergeSubscribedParentWithMove_subscription parent
1965+
1966+ liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1967+ return $ Just $ _mergeSubscribedParentWithMove_subscription parent
1968+ Just toKey -> do
1969+ liftIO $ writeIORef (_mergeSubscribedParentWithMove_key parent) $! toKey
1970+ return Nothing
1971+ toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
1972+ DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
1973+
1974+ return (toDelete, applyAlways p' oldParents)
1975+ getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParentWithMove x k)
1976+ getInitialSubscribers initialParents subscriber = do
1977+ subscribers <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1978+ keyRef <- liftIO $ newIORef k
1979+ let s = subscriber $ liftIO $ readIORef keyRef
1980+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead (nt e) s
1981+ height <- liftIO $ getEventSubscribedHeight parentSubd
1982+ return (fmap (k :=>) parentOcc, height, k :=> MergeSubscribedParentWithMove subscription keyRef)
1983+ return ( DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1984+ , fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1985+ , DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1986+ )
1987+
1988+ destroy :: MergeDestroyFunc k (MergeSubscribedParentWithMove x k)
1989+ destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParentWithMove sub _) -> unsubscribe sub
1990+
1991+type MergeUpdateFunc k v x p s
1992+ = (forall a. EventM x (k a) -> Subscriber x (v a))
1993+ -> IORef HeightBag
1994+ -> DMap k s
1995+ -> p
1996+ -> EventM x ([EventSubscription x], DMap k s)
1997+
1998+type MergeGetSubscription x s = forall a. s a -> EventSubscription x
1999+
2000+type MergeInitFunc k v q x s
2001+ = DMap k q
2002+ -> (forall a. EventM x (k a) -> Subscriber x (v a))
2003+ -> EventM x (DMap k v, [Height], DMap k s)
2004+
2005+type MergeDestroyFunc k s
2006+ = DMap k s
2007+ -> IO ()
2008+
2009+data Merge x k v s = Merge
2010+ { _merge_parentsRef :: {-# UNPACK #-} !(IORef (DMap k s))
2011+ , _merge_heightBagRef :: {-# UNPACK #-} !(IORef HeightBag)
2012+ , _merge_heightRef :: {-# UNPACK #-} !(IORef Height)
2013+ , _merge_sub :: {-# UNPACK #-} !(Subscriber x (DMap k v))
2014+ , _merge_accumRef :: {-# UNPACK #-} !(IORef (DMap k v))
2015+ }
2016+
2017+invalidateMergeHeight :: Merge x k v s -> IO ()
2018+invalidateMergeHeight m = invalidateMergeHeight' (_merge_heightRef m) (_merge_sub m)
2019+
2020+invalidateMergeHeight' :: IORef Height -> Subscriber x a -> IO ()
2021+invalidateMergeHeight' heightRef sub = do
2022+ oldHeight <- readIORef heightRef
2023+ -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
2024+ when (oldHeight /= invalidHeight) $ do
2025+ writeIORef heightRef $! invalidHeight
2026+ subscriberInvalidateHeight sub oldHeight
2027+
2028+revalidateMergeHeight :: Merge x k v s -> IO ()
2029+revalidateMergeHeight m = do
2030+ currentHeight <- readIORef $ _merge_heightRef m
2031+
2032+ -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
2033+ when (currentHeight == invalidHeight) $ do
2034+ heights <- readIORef $ _merge_heightBagRef m
2035+ parents <- readIORef $ _merge_parentsRef m
2036+ -- When the number of heights in the bag reaches the number of parents, we should have a valid height
2037+ case heightBagSize heights `compare` DMap.size parents of
2038+ LT -> return ()
2039+ EQ -> do
2040+ let height = succHeight $ heightBagMax heights
2041+ traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
2042+ writeIORef (_merge_heightRef m) $! height
2043+ subscriberRecalculateHeight (_merge_sub m) height
2044+ GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show (DMap.size parents) <> ") for Merge"
2045+
2046+scheduleMergeSelf :: HasSpiderTimeline x => Merge x k v s -> Height -> EventM x ()
2047+scheduleMergeSelf m height = scheduleMerge' height (_merge_heightRef m) $ do
2048+ vals <- liftIO $ readIORef $ _merge_accumRef m
2049+ -- Once we're done with this, we can clear it immediately, because if there's a cacheEvent in front of us,
2050+ -- it'll handle subsequent subscribers, and if not, we won't get subsequent subscribers
2051+ liftIO $ writeIORef (_merge_accumRef m) $! DMap.empty
2052+ --TODO: Assert that m is not empty
2053+ subscriberPropagate (_merge_sub m) vals
2054+
2055+checkCycle :: HasSpiderTimeline x => EventSubscribed x -> EventM x ()
2056+checkCycle subscribed = liftIO $ do
2057+ height <- readIORef (eventSubscribedHeightRef subscribed)
2058+
2059+ -- currentHeight <- getCurrentHeight
2060+ -- when (height <= currentHeight) $ if height /= invalidHeight
2061+ -- then do
2062+ -- myStack <- liftIO $ whoCreatedIORef undefined --TODO
2063+ -- error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
2064+ -- else liftIO $
2065+ when (height == invalidHeight) $
2066+#ifdef DEBUG_CYCLES
2067+ do
2068+ nodesInvolvedInCycle <- walkInvalidHeightParents subscribed
2069+ stacks <- forM nodesInvolvedInCycle whoCreatedEventSubscribed
2070+ throwIO (EventLoopException stacks)
2071+#else
2072+ throwIO EventLoopException
2073+#endif
2074+
2075+
2076+mergeSubscriber :: forall x k v s a. (HasSpiderTimeline x, GCompare k) => EventSubscribed x -> Merge x k v s -> EventM x (k a) -> Subscriber x (v a)
2077+mergeSubscriber subscribed m getKey = Subscriber
2078+ { subscriberPropagate = \a -> do
2079+ oldM <- liftIO $ readIORef $ _merge_accumRef m
2080+ k <- getKey
2081+ let newM = DMap.insertWith (error "Same key fired multiple times for Merge") k a oldM
2082+ tracePropagate (Proxy :: Proxy x) $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
2083+ liftIO $ writeIORef (_merge_accumRef m) $! newM
2084+ when (DMap.null oldM) $ do -- Only schedule the firing once
2085+ height <- liftIO $ readIORef $ _merge_heightRef m
2086+ checkCycle subscribed
2087+
2088+ scheduleMergeSelf m height
2089+ , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
2090+ modifyIORef' (_merge_heightBagRef m) $ heightBagRemove old
2091+ invalidateMergeHeight m
2092+ , subscriberRecalculateHeight = \new -> do
2093+ modifyIORef' (_merge_heightBagRef m) $ heightBagAdd new
2094+ revalidateMergeHeight m
16672095 }
16682096
2097+--TODO: Be able to run as much of this as possible promptly
2098+updateMerge :: (HasSpiderTimeline x, GCompare k) => EventSubscribed x -> Merge x k v s -> MergeUpdateFunc k v x p s -> p -> SomeMergeUpdate x
2099+updateMerge subscribed m updateFunc p = SomeMergeUpdate updateMe (invalidateMergeHeight m) (revalidateMergeHeight m)
2100+ where updateMe = do
2101+ oldParents <- liftIO $ readIORef $ _merge_parentsRef m
2102+ (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber subscribed m) (_merge_heightBagRef m) oldParents p
2103+ liftIO $ writeIORef (_merge_parentsRef m) $! newParents
2104+ return subscriptionsToKill
2105+
2106+{-# INLINE mergeGCheap' #-}
2107+mergeGCheap' :: forall k v x p s q. (HasSpiderTimeline x, GCompare k, PatchTarget p ~ DMap k q)
2108+ => MergeGetSubscription x s -> MergeInitFunc k v q x s -> MergeUpdateFunc k v x p s -> MergeDestroyFunc k s -> DynamicS x p -> Event x (DMap k v)
2109+mergeGCheap' getParent getInitialSubscribers updateFunc destroy d = Event $ \sub -> do
2110+ initialParents <- readBehaviorUntracked $ dynamicCurrent d
2111+ accumRef <- liftIO $ newIORef $ error "merge: accumRef not yet initialized"
2112+ heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
2113+ heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
2114+ parentsRef :: IORef (DMap k s) <- liftIO $ newIORef $ error "merge: parentsRef not yet initialized"
2115+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
2116+
2117+ let subscribed = EventSubscribed
2118+ { eventSubscribedHeightRef = heightRef
2119+ , eventSubscribedRetained = toAny (parentsRef, changeSubdRef)
2120+#ifdef DEBUG_CYCLES
2121+ , eventSubscribedGetParents = do
2122+ let getParent' (_ :=> v) = _eventSubscription_subscribed (getParent v)
2123+ fmap getParent' . DMap.toList <$> readIORef parentsRef
2124+ , eventSubscribedHasOwnHeightRef = False
2125+ , eventSubscribedWhoCreated = whoCreatedIORef heightRef
2126+#endif
2127+ }
2128+
2129+ m = Merge
2130+ { _merge_parentsRef = parentsRef
2131+ , _merge_heightBagRef = heightBagRef
2132+ , _merge_heightRef = heightRef
2133+ , _merge_sub = sub
2134+ , _merge_accumRef = accumRef
2135+ }
2136+ (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber subscribed m
2137+ let myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
2138+ myHeight = if invalidHeight `elem` heights
2139+ then invalidHeight
2140+ else succHeight $ heightBagMax myHeightBag
2141+ currentHeight <- getCurrentHeight
2142+ let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
2143+ then (if DMap.null dm then Nothing else Just dm, DMap.empty)
2144+ else (Nothing, dm)
2145+ unless (DMap.null accum) $ scheduleMergeSelf m myHeight
2146+ liftIO $ writeIORef accumRef $! accum
2147+ liftIO $ writeIORef heightRef $! myHeight
2148+ liftIO $ writeIORef heightBagRef $! myHeightBag
2149+ liftIO $ writeIORef parentsRef $! initialParentState
2150+ defer $ SomeMergeInit $ do
2151+ let changeSubscriber = Subscriber
2152+ { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2153+ tracePropagate (Proxy :: Proxy x) "SubscriberMerge/Change"
2154+ defer $ updateMerge subscribed m updateFunc a
2155+ , subscriberInvalidateHeight = \_ -> return ()
2156+ , subscriberRecalculateHeight = \_ -> return ()
2157+ }
2158+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2159+ forM_ change $ \c -> defer $ updateMerge subscribed m updateFunc c
2160+ -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
2161+ -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
2162+ -- its subscription.
2163+ liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2164+ let unsubscribeAll = destroy =<< readIORef parentsRef
2165+
2166+ return (EventSubscription unsubscribeAll subscribed, occ)
2167+
2168+
2169+mergeInt :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
2170+mergeInt = cacheEvent . mergeIntCheap
2171+
2172+{-# INLINABLE mergeIntCheap #-}
2173+mergeIntCheap :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
2174+mergeIntCheap d = Event $ \sub -> do
2175+ initialParents <- readBehaviorUntracked $ dynamicCurrent d
2176+ accum <- liftIO $ FastMutableIntMap.newEmpty
2177+ heightRef <- liftIO $ newIORef zeroHeight
2178+ heightBagRef <- liftIO $ newIORef heightBagEmpty
2179+ parents <- liftIO $ FastMutableIntMap.newEmpty
2180+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
2181+ let subscribed = EventSubscribed
2182+ { eventSubscribedHeightRef = heightRef
2183+ , eventSubscribedRetained = toAny (parents, changeSubdRef)
2184+#ifdef DEBUG_CYCLES
2185+ , eventSubscribedGetParents = fmap (_eventSubscription_subscribed . snd) <$> FastMutableIntMap.toList parents
2186+ , eventSubscribedHasOwnHeightRef = False
2187+ , eventSubscribedWhoCreated = whoCreatedIORef heightRef
2188+#endif
2189+ }
2190+ let scheduleSelf = do
2191+ height <- liftIO $ readIORef $ heightRef
2192+ scheduleMerge' height heightRef $ do
2193+ vals <- liftIO $ FastMutableIntMap.getFrozenAndClear accum
2194+ subscriberPropagate sub vals
2195+ invalidateMyHeight = invalidateMergeHeight' heightRef sub
2196+ recalculateMyHeight = do
2197+ currentHeight <- readIORef heightRef
2198+ when (currentHeight == invalidHeight) $ do --TODO: This will almost always be true; can we get rid of this check and just proceed to the next one always?
2199+ heights <- readIORef heightBagRef
2200+ numParents <- FastMutableIntMap.size parents
2201+ case heightBagSize heights `compare` numParents of
2202+ LT -> return ()
2203+ EQ -> do
2204+ let height = succHeight $ heightBagMax heights
2205+ traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
2206+ writeIORef heightRef $! height
2207+ subscriberRecalculateHeight sub height
2208+ GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show numParents <> ") for Merge"
2209+ mySubscriber k = Subscriber
2210+ { subscriberPropagate = \a -> do
2211+ checkCycle subscribed
2212+
2213+ wasEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
2214+ liftIO $ FastMutableIntMap.insert accum k a
2215+ when wasEmpty scheduleSelf
2216+ , subscriberInvalidateHeight = \old -> do
2217+ modifyIORef' heightBagRef $ heightBagRemove old
2218+ invalidateMyHeight
2219+ , subscriberRecalculateHeight = \new -> do
2220+ modifyIORef' heightBagRef $ heightBagAdd new
2221+ recalculateMyHeight
2222+ }
2223+ forM_ (IntMap.toList initialParents) $ \(k, p) -> do
2224+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead p $ mySubscriber k
2225+ liftIO $ do
2226+ forM_ parentOcc $ FastMutableIntMap.insert accum k
2227+ FastMutableIntMap.insert parents k subscription
2228+ height <- getEventSubscribedHeight parentSubd
2229+ if height == invalidHeight
2230+ then writeIORef heightRef invalidHeight
2231+ else do
2232+ modifyIORef' heightBagRef $ heightBagAdd height
2233+ modifyIORef' heightRef $ \oldHeight ->
2234+ if oldHeight == invalidHeight
2235+ then invalidHeight
2236+ else max (succHeight height) oldHeight
2237+ myHeight <- liftIO $ readIORef heightRef
2238+ currentHeight <- getCurrentHeight
2239+ isEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
2240+ occ <- if currentHeight >= myHeight -- If we should have fired by now
2241+ then if isEmpty
2242+ then return Nothing
2243+ else liftIO $ Just <$> FastMutableIntMap.getFrozenAndClear accum
2244+ else do when (not isEmpty) scheduleSelf -- We have things accumulated, but we shouldn't have fired them yet
2245+ return Nothing
2246+ defer $ SomeMergeInit $ do
2247+ let updateMe a = SomeMergeUpdate u invalidateMyHeight recalculateMyHeight
2248+ where
2249+ u = do
2250+ let f k newParent = do
2251+ subscription@(EventSubscription _ subd) <- subscribe newParent $ mySubscriber k
2252+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
2253+ liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
2254+ return subscription
2255+ newSubscriptions <- FastMutableIntMap.traverseIntMapPatchWithKey f a
2256+ oldParents <- liftIO $ FastMutableIntMap.applyPatch parents newSubscriptions
2257+ liftIO $ for_ oldParents $ \oldParent -> do
2258+ oldParentHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed oldParent
2259+
2260+ print ("updateMe", oldParentHeight)
2261+ modifyIORef' heightBagRef $ heightBagRemove oldParentHeight
2262+ return $ IntMap.elems oldParents
2263+ let changeSubscriber = Subscriber
2264+ { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2265+ tracePropagate (Proxy :: Proxy x) $ "SubscriberMergeInt/Change"
2266+ defer $ updateMe a
2267+ , subscriberInvalidateHeight = \_ -> return ()
2268+ , subscriberRecalculateHeight = \_ -> return ()
2269+ }
2270+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2271+ forM_ change $ \c -> defer $ updateMe c
2272+ -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
2273+ -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
2274+ -- its subscription.
2275+ liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2276+ let unsubscribeAll = traverse_ unsubscribe =<< FastMutableIntMap.getFrozenAndClear parents
2277+
2278+
2279+ return (EventSubscription unsubscribeAll subscribed, occ)
2280+
16692281newtype EventSelector x k = EventSelector { select :: forall a. k a -> Event x a }
2282+newtype EventSelectorG x k v = EventSelectorG { selectG :: forall a. k a -> Event x (v a) }
16702283
1671−fan :: GCompare k => Event x (DMap k Identity) -> EventSelector x k
1672−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
16732287 let f = Fan
16742288 { fanParent = e
1675− , fanSubscribed = unsafeNewIORef e Nothing
2289+ , fanSubscribed = ref
16762290 }
1677− in EventSelector $ \k -> eventFan k f
2291+ pure $ EventSelectorG $ \k -> eventFan k f
16782292
1679−runHoldInits :: IORef [SomeHoldInit x] -> IORef [SomeMergeInit x] -> EventM x ()
1680−runHoldInits holdInitRef mergeInitRef = do
2293+runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
2294+runHoldInits holdInitRef dynInitRef mergeInitRef = do
16812295 holdInits <- liftIO $ readIORef holdInitRef
2296+ dynInits <- liftIO $ readIORef dynInitRef
16822297 mergeInits <- liftIO $ readIORef mergeInitRef
1683− unless (null holdInits && null mergeInits) $ do
2298+ unless (null holdInits && null dynInits && null mergeInits) $ do
16842299 liftIO $ writeIORef holdInitRef []
2300+ liftIO $ writeIORef dynInitRef []
16852301 liftIO $ writeIORef mergeInitRef []
16862302 mapM_ initHold holdInits
1687− mapM_ initMerge mergeInits
1688− runHoldInits holdInitRef mergeInitRef
2303+ mapM_ initDyn dynInits
2304+ mapM_ unSomeMergeInit mergeInits
2305+ runHoldInits holdInitRef dynInitRef mergeInitRef
16892306
1690−initHold :: SomeHoldInit x -> EventM x ()
2307+initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
16912308initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
16922309
1693−initMerge :: SomeMergeInit x -> EventM x ()
1694−initMerge (SomeMergeInit subscribed changed) = do
1695− changeSub <- liftIO $ newSubscriberMergeChange subscribed
1696− EventSubscription _ changeSubd <- subscribe changed changeSub
1697− change <- liftIO $ readEventSubscribed changeSubd
1698− forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1699− liftIO $ writeIORef (mergeSubscribedChange subscribed) (changeSub, changeSubd)
2310+initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
2311+initDyn (SomeDynInit d) = void $ getDynHold d
17002312
1701−-- | Run an event action outside of a frame
1702−runFrame :: forall x a. EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1703−runFrame a = SpiderHost $ ask >>= \spiderEnv -> lift $ do
1704− -- 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
1705− pendingCleanups <- atomicModifyIORef (_spiderEnv_cleanups spiderEnv) $ \x -> ([], x)
1706− {-# SCC "cleanups" #-} sequence_ pendingCleanups
2313+newEventEnv :: IO (EventEnv x)
2314+newEventEnv = do
17072315 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
17082316 holdInitRef <- newIORef []
2317+ dynInitRef <- newIORef []
17092318 mergeUpdateRef <- newIORef []
17102319 mergeInitRef <- newIORef []
17112320 heightRef <- newIORef zeroHeight
17122321 toClearRef <- newIORef []
2322+ toClearIntRef <- newIORef []
17132323 toClearRootRef <- newIORef []
17142324 coincidenceInfosRef <- newIORef []
1715− delayedRef <- liftIO $ newIORef IntMap.empty
1716− let env = EventEnv spiderEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
2325+ delayedRef <- newIORef IntMap.empty
2326+ return $ EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef
2327+
2328+clearEventEnv :: EventEnv x -> IO ()
2329+clearEventEnv (EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef) = do
2330+ writeIORef toAssignRef []
2331+ writeIORef holdInitRef []
2332+ writeIORef dynInitRef []
2333+ writeIORef mergeUpdateRef []
2334+ writeIORef mergeInitRef []
2335+ writeIORef heightRef zeroHeight
2336+ writeIORef toClearRef []
2337+ writeIORef toClearIntRef []
2338+ writeIORef toClearRootRef []
2339+ writeIORef coincidenceInfosRef []
2340+ writeIORef delayedRef IntMap.empty
2341+
2342+-- | Run an event action outside of a frame
2343+runFrame :: forall x a. HasSpiderTimeline x => EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
2344+runFrame a = SpiderHost $ do
2345+ let env = _spiderTimeline_eventEnv $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
17172346 let go = do
17182347 result <- a
1719− runHoldInits holdInitRef mergeInitRef -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
2348+ runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
17202349 return result
1721− result <- runEventM go env
1722− toClear <- readIORef toClearRef
1723− forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
1724− toClearRoot <- readIORef toClearRootRef
1725− forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1726− toAssign <- readIORef toAssignRef
2350+ result <- runEventM go
2351+ toClear <- readIORef $ eventEnvClears env
2352+ forM_ toClear $ \(Some (Clear ref)) -> {-# SCC "clear" #-} writeIORef ref Nothing
2353+ toClearInt <- readIORef $ eventEnvIntClears env
2354+ forM_ toClearInt $ \(Some (IntClear ref)) -> {-# SCC "intClear" #-} writeIORef ref $! IntMap.empty
2355+ toClearRoot <- readIORef $ eventEnvRootClears env
2356+ forM_ toClearRoot $ \(Some (RootClear ref)) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
2357+ toAssign <- readIORef $ eventEnvAssignments env
17272358 toReconnectRef <- newIORef []
1728− coincidenceInfos <- readIORef coincidenceInfosRef
2359+ coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
17292360 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
17302361 writeIORef vRef v
1731− when debugInvalidate $ putStrLn $ "Invalidating Hold"
2362+ traceInvalidate $ "Invalidating Hold"
17322363 writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
1733− mergeUpdates <- readIORef mergeUpdateRef
1734− writeIORef mergeUpdateRef []
1735− let updateMerge :: SomeMergeUpdate x -> IO [SomeEventSubscription x]
1736− updateMerge (SomeMergeUpdate (R.PatchDMap p :: R.PatchDMap (DMap k (Event x))) m) = do
1737− oldParents <- readIORef $ mergeSubscribedParents m
1738− let f (subscriptionsToKill, ps) (k :=> Compose me) = do
1739− (mOldSubd, newPs) <- case me of
1740− Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1741− Just e -> do
1742− s <- liftIO $ newSubscriberMerge k m
1743− subscription@(EventSubscription _ subd) <- subscribe e s
1744− let newParent = MergeSubscribedParent subscription s
1745− newParentHeight <- liftIO $ getEventSubscribedHeight subd
1746− liftIO $ addMergeHeight newParentHeight m
1747− return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1748− forM_ mOldSubd $ \oldSubd -> do
1749− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1750− liftIO $ removeMergeHeight oldHeight m
1751− return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1752− (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
1753− writeIORef (mergeSubscribedParents m) $! newParents
1754− return subscriptionsToKill
1755− when debugPropagate $ putStrLn "Updating merges"
1756− mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
1757− when debugPropagate $ putStrLn "Updating merges done"
2364+ mergeUpdates <- readIORef $ eventEnvMergeUpdates env
2365+ writeIORef (eventEnvMergeUpdates env) []
2366+ tracePropagate (Proxy::Proxy x) $ "Updating merges"
2367+ mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
2368+ tracePropagate (Proxy::Proxy x) $ "Updating merges done"
17582369 toReconnect <- readIORef toReconnectRef
2370+ clearEventEnv env
17592371 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
17602372 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
17612373 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
1762− when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
2374+ traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
17632375 finalize wi
17642376 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
17652377 wi' <- mkWeakPtrWithDebug i "wi'"
17662378 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
17672379 writeIORef (switchSubscribedBehaviorParents subscribed) []
1768− writeIORef holdInitRef [] --TODO: Should we reuse this?
1769− e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
1770− 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
2380+ writeIORef (eventEnvHoldInits env) [] --TODO: Should we reuse this?
2381+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) $ eventEnvHoldInits env
2382+ runEventM $ runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) --TODO: Is this actually OK? It seems like it should be, since we know that no events are firing at this point, but it still seems inelegant
17712383 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
17722384 sub <- newSubscriberSwitch subscribed
1773− 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
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
17742386 {-
17752387 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
1776− liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
2388+ liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
17772389 EventRoot _ -> "EventRoot"
17782390 EventNever -> "EventNever"
17792391 _ -> "something else"
17802392 -}
17812393 writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
1782− return $ SomeEventSubscription oldSubscription
1783− forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1784− forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
2394+ return oldSubscription
2395+ liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
2396+ liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
17852397 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
17862398 EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
17872399 parentHeight <- getEventSubscribedHeight subd'
17882400 myHeight <- readIORef $ switchSubscribedHeight subscribed
17892401 when (parentHeight /= myHeight) $ do
17902402 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1791− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1792− forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> do
1793− 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
2403+ WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
2404+ mapM_ _someMergeUpdate_invalidateHeight mergeUpdates --TODO: In addition to when the patch is completely empty, we should also not run this if it has some Nothing values, but none of them have actually had any effect; potentially, we could even check for Just values with no effect (e.g. by comparing their IORefs and ignoring them if they are unchanged); actually, we could just check if the new height is different
17942405 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
17952406 unsubscribe subscription
17962407 mapM_ invalidateCoincidenceHeight mcs
17972408 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
1798− forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> revalidateMergeHeight m
2409+ mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
17992410 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
18002411 height <- calculateSwitchHeight subscribed
18012412 updateSwitchHeight height subscribed
@@ -1811,10 +2422,12 @@ zeroHeight = Height 0
18112422invalidHeight :: Height
18122423invalidHeight = Height (-1000)
18132424
2425+#ifdef DEBUG_CYCLES
18142426-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
18152427{-# INLINE invalidHeightBeingTraversed #-}
18162428invalidHeightBeingTraversed :: Height
18172429invalidHeightBeingTraversed = Height (-1001)
2430+#endif
18182431
18192432{-# INLINE succHeight #-}
18202433succHeight :: Height -> Height
@@ -1823,119 +2436,12 @@ succHeight h@(Height a) =
18232436 then invalidHeight
18242437 else Height $ succ a
18252438
1826−invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
1827−invalidateSubscriberHeight old s = case s of
1828− SubscriberPush _ subscribed -> do
1829− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1830− WeakBag.traverse (pushSubscribedSubscribers subscribed) $ invalidateSubscriberHeight old
1831− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1832− SubscriberMerge _ subscribed -> do
1833− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1834− removeMergeHeight old subscribed
1835− invalidateMergeHeight subscribed
1836− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1837− SubscriberMergeChange _ -> return () -- Doesn't affect the height of the merge, because its changes are delayed
1838− SubscriberFan subscribed -> do
1839− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1840− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1841− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
1842− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1843− SubscriberHold _ -> return ()
1844− SubscriberHoldIdentity _ -> return ()
1845− SubscriberSwitch subscribed -> do
1846− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1847− oldHeight <- readIORef $ switchSubscribedHeight subscribed
1848− when (oldHeight /= invalidHeight) $ do
1849− writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1850− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1851− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1852− SubscriberCoincidenceOuter subscribed -> do
1853− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1854− invalidateCoincidenceHeight subscribed
1855− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1856− SubscriberCoincidenceInner subscribed -> do
1857− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1858− invalidateCoincidenceHeight subscribed
1859− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1860− SubscriberHandle -> return ()
1861−
1862−removeMergeHeight :: Height -> MergeSubscribed x k -> IO ()
1863−removeMergeHeight oldParentHeight subscribed = do
1864− when debugInvalidateHeight $ putStrLn $ "removeMergeHeight: " <> show oldParentHeight <> " Merge" <> showNodeId subscribed
1865− oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1866− let newHeights = heightBagRemove oldParentHeight oldHeights
1867− writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1868−
1869−invalidateMergeHeight :: MergeSubscribed x k -> IO ()
1870−invalidateMergeHeight subscribed = do
1871− oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1872− -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1873− when (oldHeight /= invalidHeight) $ do
1874− writeIORef (mergeSubscribedHeight subscribed) $! invalidHeight
1875− WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1876−
1877−addMergeHeight :: Height -> MergeSubscribed x k -> IO ()
1878−addMergeHeight newParentHeight subscribed = do
1879− when debugInvalidateHeight $ putStrLn $ "addMergeHeight: " <> show newParentHeight <> " Merge" <> showNodeId subscribed
1880− oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1881− let newHeights = heightBagAdd newParentHeight oldHeights
1882− writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1883−
1884−revalidateMergeHeight :: MergeSubscribed x k -> IO ()
1885−revalidateMergeHeight subscribed = do
1886− currentHeight <- readIORef $ mergeSubscribedHeight subscribed
1887− when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1888− heights <- readIORef $ mergeSubscribedHeightBag subscribed
1889− parents <- readIORef $ mergeSubscribedParents subscribed
1890− -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1891− case heightBagSize heights `compare` DMap.size parents of
1892− LT -> return ()
1893− EQ -> do
1894− let height = succHeight $ heightBagMax heights
1895− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1896− writeIORef (mergeSubscribedHeight subscribed) $! height
1897− WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1898− GT -> error $ "revalidateMergeHeight: more heights than parents for Merge" <> showNodeId subscribed
1899−
19002439invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
19012440invalidateCoincidenceHeight subscribed = do
19022441 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
19032442 when (oldHeight /= invalidHeight) $ do
19042443 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
1905− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1906−
1907−recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
1908−recalculateSubscriberHeight new s = case s of
1909− SubscriberPush _ subscribed -> do
1910− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
1911− WeakBag.traverse (pushSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1912− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
1913− SubscriberMerge _ subscribed -> do
1914− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
1915− addMergeHeight new subscribed
1916− revalidateMergeHeight subscribed
1917− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
1918− SubscriberMergeChange _ -> return ()
1919− SubscriberFan subscribed -> do
1920− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
1921− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1922− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
1923− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
1924− SubscriberHold _ -> return ()
1925− SubscriberHoldIdentity _ -> return ()
1926− SubscriberSwitch subscribed -> do
1927− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
1928− updateSwitchHeight new subscribed
1929− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
1930− SubscriberCoincidenceOuter subscribed -> do
1931− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
1932− recalculateCoincidenceHeight subscribed
1933− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
1934− SubscriberCoincidenceInner subscribed -> do
1935− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
1936− recalculateCoincidenceHeight subscribed
1937− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
1938− SubscriberHandle -> return ()
2444+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
19392445
19402446updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
19412447updateSwitchHeight new subscribed = do
@@ -1943,7 +2449,7 @@ updateSwitchHeight new subscribed = do
19432449 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
19442450 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
19452451 writeIORef (switchSubscribedHeight subscribed) $! new
1946− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
2452+ WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
19472453
19482454recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
19492455recalculateCoincidenceHeight subscribed = do
@@ -1952,7 +2458,7 @@ recalculateCoincidenceHeight subscribed = do
19522458 height <- calculateCoincidenceHeight subscribed
19532459 when (height /= invalidHeight) $ do
19542460 writeIORef (coincidenceSubscribedHeight subscribed) $! height
1955− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
2461+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
19562462
19572463calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
19582464calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
@@ -1991,171 +2497,329 @@ invalidate toReconnectRef wis = do
19912497-- Reflex integration
19922498--------------------------------------------------------------------------------
19932499
1994−-- | The default, global Spider environment
1995−type Spider = SpiderEnv Global
1996−
19972500-- | Designates the default, global Spider timeline
1998−data Global
1999−
2000−{-# NOINLINE globalSpiderEnv #-}
2001−globalSpiderEnv :: SpiderEnv Global
2002−globalSpiderEnv = unsafePerformIO unsafeNewSpiderEnv
2003−
2004−-- | Stores all global data relevant to a particular Spider timeline; only one
2005−-- value should exist for each type @x@
2006−data SpiderEnv x = SpiderEnv
2007− { _spiderEnv_toUnsubscribe :: !(IORef [SomeEventSubscription x])
2008− , _spiderEnv_lock :: !(MVar ())
2009− , _spiderEnv_cleanups :: !(IORef [IO ()])
2010−#ifdef DEBUG
2011− , _spiderEnv_depth :: !(IORef Int)
2012−#endif
2013− }
2014−type role SpiderEnv nominal
2015−
2016−instance GEq SpiderEnv where
2017− a `geq` b = if _spiderEnv_lock a == _spiderEnv_lock b
2018− then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderEnv can't have two different 'x' arguments
2019− else Nothing
2020−
2021−unsafeNewSpiderEnv :: forall x. IO (SpiderEnv x)
2022−unsafeNewSpiderEnv = do
2023− toUnsubscribe <- newIORef []
2024− lock <- newMVar ()
2025− cleanups <- newIORef []
2026−#ifdef DEBUG
2027− depthRef <- newIORef 0
2028−#endif
2029− return $ SpiderEnv
2030− { _spiderEnv_toUnsubscribe = toUnsubscribe
2031− , _spiderEnv_lock = lock
2032− , _spiderEnv_cleanups = cleanups
2033−#ifdef DEBUG
2034− , _spiderEnv_depth = depthRef
2035−#endif
2036− }
2037−
2038−-- | Create a new SpiderEnv
2039−newSpiderEnv :: IO (Some SpiderEnv)
2040−newSpiderEnv = Some.This <$> unsafeNewSpiderEnv
2501+data SpiderTimeline x
2502+type role SpiderTimeline nominal
20412503
2042−newtype SpiderPullM x a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2043−
2044−newtype SpiderPushM x a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2045−
2046−instance R.Reflex (SpiderEnv x) where
2047− newtype Behavior (SpiderEnv x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
2048− newtype Event (SpiderEnv x) a = SpiderEvent { unSpiderEvent :: Event x a }
2049− newtype Dynamic (SpiderEnv x) a = SpiderDynamic { unSpiderDynamic :: Dynamic x Identity a } deriving (Functor, Applicative, Monad)
2050− newtype Incremental (SpiderEnv x) p a = SpiderIncremental { unSpiderIncremental :: Dynamic x p a }
2051− type PullM (SpiderEnv x) = SpiderPullM x
2052− type PushM (SpiderEnv x) = SpiderPushM x
2053− {-# INLINABLE never #-}
2054− never = SpiderEvent eventNever
2055− {-# INLINABLE constant #-}
2056− constant = SpiderBehavior . BehaviorConst
2057− {-# INLINABLE push #-}
2058− push f = SpiderEvent . push (coerce f) . unSpiderEvent
2059− {-# INLINABLE pull #-}
2060− pull = SpiderBehavior . pull . coerce
2061− {-# INLINABLE merge #-}
2062− merge = SpiderEvent . merge . DynamicConst . (unsafeCoerce :: DMap k (R.Event (SpiderEnv x)) -> DMap k (Event x))
2063− {-# INLINABLE fan #-}
2064− fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
2065− {-# INLINABLE switch #-}
2066− switch = SpiderEvent . switch . (unsafeCoerce :: Behavior x (R.Event (SpiderEnv x) a) -> Behavior x (Event x a)) . unSpiderBehavior
2067− {-# INLINABLE coincidence #-}
2068− coincidence = SpiderEvent . coincidence . (unsafeCoerce :: Event x (R.Event (SpiderEnv x) a) -> Event x (Event x a)) . unSpiderEvent
2069− {-# INLINABLE current #-}
2070− current = SpiderBehavior . current . unSpiderDynamic
2071− {-# INLINABLE updated #-}
2072− updated = SpiderEvent . fmap runIdentity . updated . unSpiderDynamic
2073− {-# INLINABLE unsafeBuildDynamic #-}
2074− unsafeBuildDynamic readV0 v' = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (coerce readV0) $ addIdentity $ unSpiderEvent v'
2075− {-# INLINABLE unsafeBuildIncremental #-}
2076− unsafeBuildIncremental readV0 dv = SpiderIncremental $ DynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
2077− {-# INLINABLE mergeIncremental #-}
2078− mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic x R.PatchDMap (DMap k (R.Event (SpiderEnv x))) -> Dynamic x R.PatchDMap (DMap k (Event x))) . unSpiderIncremental
2079− {-# INLINABLE currentIncremental #-}
2080− currentIncremental = SpiderBehavior . current . unSpiderIncremental
2081− {-# INLINABLE updatedIncremental #-}
2082− updatedIncremental = SpiderEvent . updated . unSpiderIncremental
2083− {-# INLINABLE incrementalToDynamic #-}
2084− incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ current i) $ flip push (updated i) $ \p -> do
2085− c <- readBehaviorUntracked $ current i
2086− return $ Identity <$> R.apply p c --TODO: Avoid the redundant 'apply'
2504+-- | The default, global Spider environment
2505+type Spider = SpiderTimeline Global
20872506
2088−instance R.MonadSample (SpiderEnv x) (EventM x) where
2507+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
20892508 {-# INLINABLE sample #-}
20902509 sample (SpiderBehavior b) = readBehaviorUntracked b
20912510
2092−instance R.MonadHold (SpiderEnv x) (EventM x) where
2511+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (EventM x) where
20932512 {-# INLINABLE hold #-}
20942513 hold = holdSpiderEventM
20952514 {-# INLINABLE holdDyn #-}
20962515 holdDyn = holdDynSpiderEventM
20972516 {-# INLINABLE holdIncremental #-}
20982517 holdIncremental = holdIncrementalSpiderEventM
2518+ {-# INLINABLE buildDynamic #-}
2519+ buildDynamic = buildDynamicSpiderEventM
2520+ {-# INLINABLE headE #-}
2521+ headE = R.slowHeadE
2522+-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
2523+ {-# INLINABLE now #-}
2524+ now = nowSpiderEventM
2525+
2526+instance Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
2527+ {-# INLINABLE sample #-}
2528+ sample = coerce . readBehaviorTracked . unSpiderBehavior
2529+
2530+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531+ {-# INLINABLE sample #-}
2532+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2533+
2534+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderPushM x) where
2535+ {-# INLINABLE hold #-}
2536+ hold v0 e = Reflex.Class.current <$> Reflex.Class.holdDyn v0 e
2537+ {-# INLINABLE holdDyn #-}
2538+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce e
2539+ {-# INLINABLE holdIncremental #-}
2540+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . dynamicHold <$> Reflex.Spider.Internal.hold v0 e
2541+ {-# INLINABLE buildDynamic #-}
2542+ buildDynamic getV0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce e
2543+ {-# INLINABLE headE #-}
2544+ headE = R.slowHeadE
2545+-- headE (SpiderEvent e) = SpiderPushM $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2546+ {-# INLINABLE now #-}
2547+ now = SpiderPushM nowSpiderEventM
2548+
20992549
2100−holdSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Behavior (SpiderEnv x) a)
2101−holdSpiderEventM v0 e = fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2550+instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
2551+ {-# INLINE return #-}
2552+ return = pure
2553+ {-# INLINE (>>=) #-}
2554+ x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
2555+ {-# INLINE (>>) #-}
2556+ (>>) = (*>)
2557+#if !MIN_VERSION_base(4,13,0)
2558+ {-# INLINE fail #-}
2559+ fail _ = error "Dynamic does not support 'fail'"
2560+#endif
2561+
2562+{-# INLINABLE newJoinDyn #-}
2563+newJoinDyn :: HasSpiderTimeline x => DynamicS x (Identity (DynamicS x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
2564+newJoinDyn d =
2565+ let readV0 = readBehaviorTracked . dynamicCurrent =<< readBehaviorTracked (dynamicCurrent d)
2566+ eOuter = Reflex.Spider.Internal.push (fmap (Just . Identity) . readBehaviorUntracked . dynamicCurrent . runIdentity) $ dynamicUpdated d
2567+ eInner = Reflex.Spider.Internal.switch $ dynamicUpdated <$> dynamicCurrent d
2568+ eBoth = Reflex.Spider.Internal.coincidence $ dynamicUpdated . runIdentity <$> dynamicUpdated d
2569+ v' = unSpiderEvent $ Reflex.Class.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
2570+ in Reflex.Spider.Internal.unsafeBuildDynamic readV0 v'
2571+
2572+instance HasSpiderTimeline x => Functor (Reflex.Class.Dynamic (SpiderTimeline x)) where
2573+ fmap = mapDynamicSpider
2574+ x <$ d = R.unsafeBuildDynamic (return x) $ x <$ R.updated d
2575+
2576+mapDynamicSpider :: HasSpiderTimeline x => (a -> b) -> Reflex.Class.Dynamic (SpiderTimeline x) a -> Reflex.Class.Dynamic (SpiderTimeline x) b
2577+mapDynamicSpider f = SpiderDynamic . newMapDyn f . unSpiderDynamic
2578+{-# INLINE [1] mapDynamicSpider #-}
2579+
2580+instance HasSpiderTimeline x => Applicative (Reflex.Class.Dynamic (SpiderTimeline x)) where
2581+ pure = SpiderDynamic . dynamicConst
2582+#if MIN_VERSION_base(4,10,0)
2583+ liftA2 f a b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith f (unSpiderDynamic a) (unSpiderDynamic b)
2584+#endif
2585+ SpiderDynamic a <*> SpiderDynamic b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith ($) a b
2586+ a *> b = R.unsafeBuildDynamic (R.sample $ R.current b) $ R.leftmost [R.updated b, R.tag (R.current b) $ R.updated a]
2587+ (<*) = flip (*>) -- There are no effects, so order doesn't matter
2588+
2589+holdSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Behavior (SpiderTimeline x) a)
2590+holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2591+
2592+holdDynSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2593+holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
21022594
2103−holdDynSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Dynamic (SpiderEnv x) a)
2104−holdDynSpiderEventM v0 e = fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2595+holdIncrementalSpiderEventM :: (HasSpiderTimeline x, Patch p) => PatchTarget p -> Reflex.Class.Event (SpiderTimeline x) p -> EventM x (Reflex.Class.Incremental (SpiderTimeline x) p)
2596+holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
21052597
2106−holdIncrementalSpiderEventM :: R.Patch p => a -> R.Event (SpiderEnv x) (p a) -> EventM x (R.Incremental (SpiderEnv x) p a)
2107−holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2598+buildDynamicSpiderEventM :: HasSpiderTimeline x => SpiderPushM x a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2599+buildDynamicSpiderEventM getV0 e = fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
21082600
2109−instance R.MonadHold (SpiderEnv x) (SpiderHost x) where
2601+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
21102602 {-# INLINABLE hold #-}
2111− hold v0 e = R.runHostFrame $ R.hold v0 e
2603+ hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
21122604 {-# INLINABLE holdDyn #-}
2113− holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
2605+ holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
21142606 {-# INLINABLE holdIncremental #-}
2115− holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
2607+ holdIncremental v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdIncremental v0 e
2608+ {-# INLINABLE buildDynamic #-}
2609+ buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
2610+ {-# INLINABLE headE #-}
2611+ headE e = runFrame . runSpiderHostFrame $ Reflex.Class.headE e
2612+ {-# INLINABLE now #-}
2613+ now = runFrame . runSpiderHostFrame $ Reflex.Class.now
2614+
2615+
2616+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
2617+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
21162618
2117−instance R.MonadSample (SpiderEnv x) (SpiderHost x) where
2619+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2620+ {-# INLINABLE hold #-}
2621+ hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2622+ {-# INLINABLE holdDyn #-}
2623+ holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2624+ {-# INLINABLE holdIncremental #-}
2625+ holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2626+ {-# INLINABLE buildDynamic #-}
2627+ buildDynamic getV0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
2628+ {-# INLINABLE headE #-}
2629+ headE = R.slowHeadE
2630+-- headE (SpiderEvent e) = SpiderHostFrame $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2631+ {-# INLINABLE now #-}
2632+ now = SpiderHostFrame Reflex.Class.now
2633+
2634+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
21182635 {-# INLINABLE sample #-}
21192636 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
21202637
2121−instance R.MonadSample (SpiderEnv x) (SpiderPullM x) where
2638+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
21222639 {-# INLINABLE sample #-}
2123− sample = coerce . readBehaviorTracked . unSpiderBehavior
2124−
2125−instance R.MonadSample (SpiderEnv x) (SpiderPushM x) where
2126− {-# INLINABLE sample #-}
2127− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2640+ sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
21282641
2129−instance R.MonadHold (SpiderEnv x) (SpiderPushM x) where
2642+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
21302643 {-# INLINABLE hold #-}
2131− hold v0 e = R.current <$> R.holdDyn v0 e
2644+ hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
21322645 {-# INLINABLE holdDyn #-}
2133− holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity e
2646+ holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
21342647 {-# INLINABLE holdIncremental #-}
2135− holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . DynamicHold <$> hold v0 e
2648+ holdIncremental v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdIncremental v0 e
2649+ {-# INLINABLE buildDynamic #-}
2650+ buildDynamic getV0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.buildDynamic getV0 e
2651+ {-# INLINABLE headE #-}
2652+ headE e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.headE e
2653+ {-# INLINABLE now #-}
2654+ now = Reflex.Spider.Internal.ReadPhase Reflex.Class.now
21362655
2137−data RootTrigger x a = forall k. GCompare k => RootTrigger (SubscriberList x a, IORef (DMap k Identity), k a)
2138−newtype SpiderEventHandle x a = SpiderEventHandle { unSpiderEventHandle :: EventSubscription x a }
2656+--------------------------------------------------------------------------------
2657+-- Deprecated items
2658+--------------------------------------------------------------------------------
21392659
2140−instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHostFrame x) where
2660+-- | 'SpiderEnv' is the old name for 'SpiderTimeline'
2661+{-# DEPRECATED SpiderEnv "Use 'SpiderTimelineEnv' instead" #-}
2662+type SpiderEnv = SpiderTimeline
2663+instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHostFrame x) where
21412664 {-# INLINABLE subscribeEvent #-}
21422665 subscribeEvent e = SpiderHostFrame $ do
2143− subscription <- subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2144− return $ SpiderEventHandle subscription
2145−
2146−instance R.ReflexHost (SpiderEnv x) where
2147− type EventTrigger (SpiderEnv x) = RootTrigger x
2148− type EventHandle (SpiderEnv x) = SpiderEventHandle x
2149− type HostFrame (SpiderEnv x) = SpiderHostFrame x
2150−
2151−instance R.MonadReadEvent (SpiderEnv x) (ReadPhase x) where
2152− {-# INLINABLE readEvent #-}
2153− readEvent h = ReadPhase $ fmap (fmap return) $ liftIO $ do
2154− let EventSubscription sln subscribed = unSpiderEventHandle h
2155− result <- readEventSubscribed subscribed
2156− touch sln
2666+ --TODO: Unsubscribe eventually (manually and/or with weak ref)
2667+ val <- liftIO $ newIORef Nothing
2668+ subscription <- subscribe (unSpiderEvent e) $ Subscriber
2669+ { subscriberPropagate = \a -> do
2670+ liftIO $ writeIORef val $ Just a
2671+ scheduleClear val
2672+ , subscriberInvalidateHeight = \_ -> return ()
2673+ , subscriberRecalculateHeight = \_ -> return ()
2674+ }
2675+ return $ SpiderEventHandle
2676+ { spiderEventHandleSubscription = subscription
2677+ , spiderEventHandleValue = val
2678+ }
2679+
2680+instance HasSpiderTimeline x => Reflex.Host.Class.ReflexHost (SpiderTimeline x) where
2681+ type EventTrigger (SpiderTimeline x) = RootTrigger x
2682+ type EventHandle (SpiderTimeline x) = SpiderEventHandle x
2683+ type HostFrame (SpiderTimeline x) = SpiderHostFrame x
2684+
2685+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2686+ {-# NOINLINE readEvent #-}
2687+ readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
2688+ result <- readIORef $ spiderEventHandleValue h
2689+ touch h
21572690 return result
21582691
2692+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
2693+ newEventWithTrigger = SpiderHost . fmap SpiderEvent . newEventWithTriggerIO
2694+ newFanEventWithTrigger f = SpiderHost $ do
2695+ es <- newFanEventWithTriggerIO f
2696+ return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
2697+
2698+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
2699+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2700+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2701+ es <- newFanEventWithTriggerIO f
2702+ return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
2703+
2704+instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHost x) where
2705+ {-# INLINABLE subscribeEvent #-}
2706+ subscribeEvent = runFrame . runSpiderHostFrame . Reflex.Host.Class.subscribeEvent
2707+
2708+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexHost (SpiderTimeline x) (SpiderHost x) where
2709+ type ReadPhase (SpiderHost x) = Reflex.Spider.Internal.ReadPhase x
2710+ fireEventsAndRead es (Reflex.Spider.Internal.ReadPhase a) = run es a
2711+ runHostFrame = runFrame . runSpiderHostFrame
2712+
2713+unsafeNewSpiderTimelineEnv :: forall x. IO (SpiderTimelineEnv x)
2714+unsafeNewSpiderTimelineEnv = do
2715+ lock <- newMVar ()
2716+ env <- newEventEnv
2717+#ifdef DEBUG
2718+ depthRef <- newIORef 0
2719+#endif
2720+ return $ STE $ SpiderTimelineEnv
2721+ { _spiderTimeline_lock = lock
2722+ , _spiderTimeline_eventEnv = env
2723+#ifdef DEBUG
2724+ , _spiderTimeline_depth = depthRef
2725+#endif
2726+ }
2727+
2728+-- | Create a new SpiderTimelineEnv
2729+newSpiderTimeline :: IO (Some SpiderTimelineEnv)
2730+newSpiderTimeline = withSpiderTimeline (pure . Some)
2731+
2732+data LocalSpiderTimeline (x :: Type) s
2733+
2734+instance Reifies s (SpiderTimelineEnv x) =>
2735+ HasSpiderTimeline (LocalSpiderTimeline x s) where
2736+ spiderTimeline = localSpiderTimeline Proxy $ reflect (Proxy :: Proxy s)
2737+
2738+localSpiderTimeline
2739+ :: proxy s
2740+ -> SpiderTimelineEnv x
2741+ -> SpiderTimelineEnv (LocalSpiderTimeline x s)
2742+localSpiderTimeline _ = coerce
2743+
2744+-- | Pass a new timeline to the given function.
2745+withSpiderTimeline :: (forall x. HasSpiderTimeline x => SpiderTimelineEnv x -> IO r) -> IO r
2746+withSpiderTimeline k = do
2747+ env <- unsafeNewSpiderTimelineEnv
2748+ reify env $ \s -> k $ localSpiderTimeline s env
2749+
2750+newtype SpiderPullM (x :: Type) a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2751+
2752+type ComputeM = EventM
2753+
2754+newtype SpiderPushM (x :: Type) a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2755+
2756+instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
2757+ {-# SPECIALIZE instance R.Reflex (SpiderTimeline Global) #-}
2758+ newtype Behavior (SpiderTimeline x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
2759+ newtype Event (SpiderTimeline x) a = SpiderEvent { unSpiderEvent :: Event x a }
2760+ newtype Dynamic (SpiderTimeline x) a = SpiderDynamic { unSpiderDynamic :: DynamicS x (Identity a) } -- deriving (Functor, Applicative, Monad)
2761+ newtype Incremental (SpiderTimeline x) p = SpiderIncremental { unSpiderIncremental :: DynamicS x p }
2762+ type PullM (SpiderTimeline x) = SpiderPullM x
2763+ type PushM (SpiderTimeline x) = SpiderPushM x
2764+ {-# INLINABLE never #-}
2765+ never = SpiderEvent eventNever
2766+ {-# INLINABLE constant #-}
2767+ constant = SpiderBehavior . behaviorConst
2768+ {-# INLINE push #-}
2769+ push f = SpiderEvent . push (coerce f) . unSpiderEvent
2770+ {-# INLINE pushCheap #-}
2771+ pushCheap f = SpiderEvent . pushCheap (coerce f) . unSpiderEvent
2772+ {-# INLINABLE pull #-}
2773+ pull = SpiderBehavior . pull . coerce
2774+ {-# INLINABLE fanG #-}
2775+ fanG e = R.EventSelectorG $ SpiderEvent . selectG (fanG (unSpiderEvent e))
2776+ {-# INLINABLE mergeG #-}
2777+ mergeG
2778+ :: forall k2 (k :: k2 -> *) q (v :: k2 -> *). GCompare k
2779+ => (forall a. q a -> R.Event (SpiderTimeline x) (v a))
2780+ -> DMap k q
2781+ -> R.Event (SpiderTimeline x) (DMap k v)
2782+ mergeG nt = SpiderEvent . mergeG (unSpiderEvent #. nt) . dynamicConst
2783+ {-# INLINABLE switch #-}
2784+ switch = SpiderEvent . switch . (coerce :: Behavior x (R.Event (SpiderTimeline x) a) -> Behavior x (Event x a)) . unSpiderBehavior
2785+ {-# INLINABLE coincidence #-}
2786+ coincidence = SpiderEvent . coincidence . (coerce :: Event x (R.Event (SpiderTimeline x) a) -> Event x (Event x a)) . unSpiderEvent
2787+ {-# INLINABLE current #-}
2788+ current = SpiderBehavior . dynamicCurrent . unSpiderDynamic
2789+ {-# INLINABLE updated #-}
2790+ updated = SpiderEvent #. dynamicUpdated .# fmap coerce . unSpiderDynamic
2791+ {-# INLINABLE unsafeBuildDynamic #-}
2792+ unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ unsafeBuildDynamic (coerce readV0) $ coerce $ unSpiderEvent v'
2793+ {-# INLINABLE unsafeBuildIncremental #-}
2794+ unsafeBuildIncremental readV0 dv = SpiderIncremental $ dynamicDyn $ unsafeBuildDynamic (coerce readV0) $ unSpiderEvent dv
2795+ {-# INLINABLE mergeIncrementalG #-}
2796+ mergeIncrementalG nt = SpiderEvent #. mergeG (coerce #. nt) .# unSpiderIncremental
2797+ {-# INLINABLE mergeIncrementalWithMoveG #-}
2798+ mergeIncrementalWithMoveG nt = SpiderEvent #. mergeWithMove (coerce #. nt) .# unSpiderIncremental
2799+ {-# INLINABLE currentIncremental #-}
2800+ currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
2801+ {-# INLINABLE updatedIncremental #-}
2802+ updatedIncremental = SpiderEvent . dynamicUpdated . unSpiderIncremental
2803+ {-# INLINABLE incrementalToDynamic #-}
2804+ incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ dynamicDynIdentity $ unsafeBuildDynamic (readBehaviorUntracked $ dynamicCurrent i) $ flip push (dynamicUpdated i) $ \p -> do
2805+ c <- readBehaviorUntracked $ dynamicCurrent i
2806+ return $ Identity <$> apply p c --TODO: Avoid the redundant 'apply'
2807+ eventCoercion Coercion = Coercion
2808+ behaviorCoercion Coercion = Coercion
2809+ dynamicCoercion Coercion = Coercion
2810+ incrementalCoercion Coercion Coercion = Coercion
2811+ {-# INLINABLE mergeIntIncremental #-}
2812+ mergeIntIncremental = SpiderEvent . mergeInt . coerce
2813+ {-# INLINABLE fanInt #-}
2814+ fanInt e = R.EventSelectorInt $ SpiderEvent . selectInt (fanInt (unSpiderEvent e))
2815+
2816+data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
2817+
2818+data SpiderEventHandle x a = SpiderEventHandle
2819+ { spiderEventHandleSubscription :: EventSubscription x
2820+ , spiderEventHandleValue :: IORef (Maybe a)
2821+ }
2822+
21592823instance MonadRef (EventM x) where
21602824 type Ref (EventM x) = Ref IO
21612825 {-# INLINABLE newRef #-}
@@ -2170,7 +2834,7 @@ instance MonadAtomicRef (EventM x) where
21702834 atomicModifyRef r f = liftIO $ atomicModifyRef r f
21712835
21722836-- | The monad for actions that manipulate a Spider timeline identified by @x@
2173−newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2837+newtype SpiderHost (x :: Type) a = SpiderHost { unSpiderHost :: IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
21742838
21752839instance Monad (SpiderHost x) where
21762840 {-# INLINABLE (>>=) #-}
@@ -2179,15 +2843,27 @@ instance Monad (SpiderHost x) where
21792843 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
21802844 {-# INLINABLE return #-}
21812845 return x = SpiderHost $ return x
2846+#if !MIN_VERSION_base(4,13,0)
2847+ {-# INLINABLE fail #-}
2848+ fail = MonadFail.fail
2849+#endif
2850+
2851+instance MonadFail (SpiderHost x) where
21822852 {-# INLINABLE fail #-}
2183− fail s = SpiderHost $ fail s
2853+ fail s = SpiderHost $ MonadFail.fail s
21842854
21852855-- | Run an action affecting the global Spider timeline; this will be guarded by
21862856-- a mutex for that timeline
21872857runSpiderHost :: SpiderHost Global a -> IO a
2188−runSpiderHost (SpiderHost a) = runReaderT a globalSpiderEnv
2858+runSpiderHost (SpiderHost a) = a
21892859
2190−newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2860+-- | Run an action affecting a given Spider timeline; this will be guarded by a
2861+-- mutex for that timeline
2862+runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimelineEnv x -> IO a
2863+runSpiderHostForTimeline (SpiderHost a) _ = a
2864+
2865+newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866+ deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
21912867
21922868instance Monad (SpiderHostFrame x) where
21932869 {-# INLINABLE (>>=) #-}
@@ -2196,30 +2872,21 @@ instance Monad (SpiderHostFrame x) where
21962872 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
21972873 {-# INLINABLE return #-}
21982874 return x = SpiderHostFrame $ return x
2875+#if !MIN_VERSION_base(4,13,0)
21992876 {-# INLINABLE fail #-}
22002877 fail s = SpiderHostFrame $ fail s
2878+#endif
22012879
2202−instance R.MonadSample (SpiderEnv x) (SpiderHostFrame x) where
2203− sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2204−
2205−addIdentity :: Event x a -> Event x (Identity a)
2206−--addIdentity = fmap Identity
2207−addIdentity = unsafeCoerce
2208−
2209−instance R.MonadHold (SpiderEnv x) (SpiderHostFrame x) where
2210− {-# INLINABLE hold #-}
2211− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2212− {-# INLINABLE holdDyn #-}
2213− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2214− {-# INLINABLE holdIncremental #-}
2215− holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2880+instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2881+ notReadyUntil _ = pure ()
2882+ notReady = pure ()
22162883
2217−newEventWithTriggerIO :: (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2884+newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
22182885newEventWithTriggerIO f = do
22192886 es <- newFanEventWithTriggerIO $ \Refl -> f
22202887 return $ select es Refl
22212888
2222−newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2889+newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
22232890newFanEventWithTriggerIO f = do
22242891 occRef <- newIORef DMap.empty
22252892 subscribedRef <- newIORef DMap.empty
@@ -2230,46 +2897,8 @@ newFanEventWithTriggerIO f = do
22302897 }
22312898 return $ EventSelector $ \k -> eventRoot k r
22322899
2233−instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHost x) where
2234− newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
2235− newFanEventWithTrigger f = SpiderHost $ lift $ do
2236− es <- newFanEventWithTriggerIO f
2237− return $ R.EventSelector $ SpiderEvent . select es
2238−
2239−instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHostFrame x) where
2240− newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2241− newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2242− es <- newFanEventWithTriggerIO f
2243− return $ R.EventSelector $ SpiderEvent . select es
2244−
2245−instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHost x) where
2246− {-# INLINABLE subscribeEvent #-}
2247− subscribeEvent = subscribeEventSpiderHost
2248−
2249−subscribeEventSpiderHost :: R.Event (SpiderEnv x) a -> SpiderHost x (R.EventHandle (SpiderEnv x) a)
2250−subscribeEventSpiderHost e = do
2251− subscription <- runFrame $ subscribe (unSpiderEvent e) SubscriberHandle --TODO: Unsubscribe eventually (manually and/or with weak ref)
2252− return $ SpiderEventHandle subscription
2253−
22542900newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
22552901
2256−instance R.MonadSample (SpiderEnv x) (ReadPhase x) where
2257− {-# INLINABLE sample #-}
2258− sample = ReadPhase . R.sample
2259−
2260−instance R.MonadHold (SpiderEnv x) (ReadPhase x) where
2261− {-# INLINABLE hold #-}
2262− hold v0 e = ReadPhase $ R.hold v0 e
2263− {-# INLINABLE holdDyn #-}
2264− holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2265− {-# INLINABLE holdIncremental #-}
2266− holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2267−
2268−instance R.MonadReflexHost (SpiderEnv x) (SpiderHost x) where
2269− type ReadPhase (SpiderHost x) = ReadPhase x
2270− fireEventsAndRead es (ReadPhase a) = run es a
2271− runHostFrame = runFrame . runSpiderHostFrame
2272−
22732902instance MonadRef (SpiderHost x) where
22742903 type Ref (SpiderHost x) = Ref IO
22752904 newRef = SpiderHost . newRef
@@ -2287,3 +2916,15 @@ instance MonadRef (SpiderHostFrame x) where
22872916
22882917instance MonadAtomicRef (SpiderHostFrame x) where
22892918 atomicModifyRef r = SpiderHostFrame . atomicModifyRef r
2919+
2920+instance PrimMonad (SpiderHostFrame x) where
2921+ type PrimState (SpiderHostFrame x) = PrimState IO
2922+ primitive = SpiderHostFrame . EventM . primitive
2923+
2924+instance NotReady (SpiderTimeline x) (SpiderHost x) where
2925+ notReadyUntil _ = return ()
2926+ notReady = return ()
2927+
2928+instance HasSpiderTimeline x => NotReady (SpiderTimeline x) (PerformEventT (SpiderTimeline x) (SpiderHost x)) where
2929+ notReadyUntil _ = return ()
2930+ notReady = return ()