@@ -9,125 +9,78 @@
99{-# LANGUAGE GADTs #-}
1010{-# LANGUAGE GeneralizedNewtypeDeriving #-}
1111{-# LANGUAGE LambdaCase #-}
12+{-# LANGUAGE MagicHash #-}
13+{-# LANGUAGE MultiParamTypeClasses #-}
14+{-# LANGUAGE MultiWayIf #-}
1215{-# LANGUAGE RankNTypes #-}
1316{-# LANGUAGE RoleAnnotations #-}
1417{-# LANGUAGE ScopedTypeVariables #-}
1518{-# LANGUAGE TypeFamilies #-}
1619{-# LANGUAGE TypeOperators #-}
1720{-# LANGUAGE UndecidableInstances #-}
18−{-# LANGUAGE PolyKinds #-}
19−{-# LANGUAGE DeriveFunctor #-}
20−{-# LANGUAGE StandaloneDeriving #-}
21−{-# LANGUAGE InstanceSigs #-}
22−{-# LANGUAGE MultiWayIf #-}
23−
24−#ifdef USE_REFLEX_OPTIMIZER
25−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
26−#endif
27−{-# OPTIONS_GHC -Wunused-binds #-}
2821-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
2922-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
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
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
3534import Control.Concurrent
3635import Control.Exception
37−import Control.Monad hiding (forM, forM_, mapM, mapM_)
36+import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
3837import Control.Monad.Exception
39−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
38+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
4039import Control.Monad.Primitive
41−import Control.Monad.Reader.Class
42−import Control.Monad.IO.Class
43−import Control.Monad.ReaderIO
40+import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
4441import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
46−import qualified Control.Monad.Fail as MonadFail
4742import Data.Align
4843import Data.Coerce
49−import Data.Dependent.Map (DMap)
44+import Data.Dependent.Map (DMap, DSum (..))
5045import 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
5446import Data.Foldable hiding (concat, elem, sequence_)
47+import Data.Function
48+import Data.Functor.Compose
5549import Data.Functor.Constant
56−import Data.Functor.Misc
5750import Data.Functor.Product
5851import Data.GADT.Compare
5952import Data.IntMap.Strict (IntMap)
6053import qualified Data.IntMap.Strict as IntMap
6154import Data.IORef
62−import Data.Kind (Type)
63−import Data.Maybe hiding (mapMaybe)
64−import Data.Monoid (mempty, (<>))
65−import Data.Proxy
55+import Data.List hiding (foldl')
56+import Data.Maybe
57+import Data.Monoid ((<>))
58+import Data.Some (Some)
59+import qualified Data.Some as Some
6660import Data.These
6761import Data.Traversable
68−import Data.Type.Equality ((:~:)(Refl))
69−import Data.Witherable (Filterable, mapMaybe)
70−import GHC.Exts hiding (toList)
62+import Data.Word
7163import GHC.IORef (IORef (..))
7264import GHC.Stack
73−import Reflex.FastWeak
7465import System.IO.Unsafe
7566import System.Mem.Weak
7667import Unsafe.Coerce
7768
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−
8769#ifdef DEBUG_CYCLES
8870import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89−#endif
90−
9171import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
9272import qualified Data.List.NonEmpty as NonEmpty
73+import Data.Monoid (mempty)
9374import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
95−
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
97−import qualified Data.FastWeakBag as FastWeakBag
75+#endif
9876
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)
77+import Data.WeakBag (WeakBag, WeakBagTicket)
10478import qualified Data.WeakBag as WeakBag
105−import qualified Reflex.Class
10679import qualified Reflex.Class as R
107−import qualified Reflex.Host.Class
108−import Reflex.NotReady.Class
109−import Data.Patch
110−import qualified Data.Patch.DMapWithMove as PatchDMapWithMove
111−import Reflex.PerformEvent.Base (PerformEventT)
112−
113−#ifdef DEBUG_TRACE_EVENTS
114−import qualified Data.ByteString.Char8 as BS8
115−import System.IO (stderr)
116−import Data.List (isPrefixOf)
117−#endif
118−
119−-- TODO stdout might not be the best channel for debug output
120−debugStrLn :: String -> IO ()
121−debugStrLn = putStrLn
80+import qualified Reflex.Host.Class as R
12281
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
82+-- Note: must come last to silence warnings due to AMP on GHC < 7.10
83+import Prelude hiding (any, concat, mapM, mapM_, sequence)
13184
13285debugPropagate :: Bool
13386
@@ -136,42 +89,31 @@ debugInvalidateHeight :: Bool
13689debugInvalidate :: Bool
13790
13891#ifdef DEBUG
92+
13993#define DEBUG_NODEIDS
14094
141−#ifdef DEBUG_TRACE_PROPAGATION
14295debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
14696
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
15097debugInvalidateHeight = False
151−#endif
15298
153−#ifdef DEBUG_TRACE_INVALIDATION
15499debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
158100
159101class HasNodeId a where
160102 getNodeId :: a -> Int
161103
162−instance HasNodeId (CacheSubscribed x a) where
163− getNodeId = _cacheSubscribed_nodeId
164−
165−instance HasNodeId (FanInt x a) where
166− getNodeId = _fanInt_nodeId
167−
168−instance HasNodeId (Hold x p) where
104+instance HasNodeId (Hold x p a) where
169105 getNodeId = holdNodeId
170106
107+instance HasNodeId (PushSubscribed x a b) where
108+ getNodeId = pushSubscribedNodeId
109+
171110instance HasNodeId (SwitchSubscribed x a) where
172111 getNodeId = switchSubscribedNodeId
173112
174−instance HasNodeId (FanSubscribed x v a) where
113+instance HasNodeId (MergeSubscribed x a) where
114+ getNodeId = mergeSubscribedNodeId
115+
116+instance HasNodeId (FanSubscribed x a) where
175117 getNodeId = fanSubscribedNodeId
176118
177119instance HasNodeId (CoincidenceSubscribed x a) where
@@ -185,16 +127,41 @@ instance HasNodeId (Pull x a) where
185127
186128{-# INLINE showNodeId #-}
187129showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
192−
130+showNodeId = ("#"<>) . show . getNodeId
131+
132+showSubscriberType :: Subscriber x a -> String
133+showSubscriberType = \case
134+ SubscriberPush _ _ -> "SubscriberPush"
135+ SubscriberMerge _ _ -> "SubscriberMerge"
136+ SubscriberFan _ -> "SubscriberFan"
137+ SubscriberMergeChange _ -> "SubscriberMergeChange"
138+ SubscriberHold _ -> "SubscriberHold"
139+ SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
140+ SubscriberSwitch _ -> "SubscriberSwitch"
141+ SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
142+ SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
143+ SubscriberHandle -> "SubscriberHandle"
144+
145+showEventType :: Event x a -> String
146+showEventType = \case
147+ EventRoot _ _ -> "EventRoot"
148+ EventNever -> "EventNever"
149+ EventPush _ -> "EventPush"
150+ EventMerge _ -> "EventMerge"
151+ EventFan _ _ -> "EventFan"
152+ EventSwitch _ -> "EventSwitch"
153+ EventCoincidence _ -> "EventCoincidence"
154+ EventHold _ -> "EventHold"
155+ EventDyn _ -> "EventDyn"
156+ EventHoldIdentity _ -> "EventHoldIdentity"
157+ EventDynIdentity _ -> "EventDynIdentity"
193158
194159#else
195160
196161debugPropagate = False
162+
197163debugInvalidateHeight = False
164+
198165debugInvalidate = False
199166
200167-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -202,10 +169,6 @@ debugInvalidate = False
202169showNodeId :: a -> String
203170showNodeId _ = ""
204171
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209172#endif
210173
211174#ifdef DEBUG_NODEIDS
@@ -215,237 +178,65 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
215178
216179newNodeId :: IO Int
217180newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
218−#endif
219−
220−--------------------------------------------------------------------------------
221−-- EventSubscription
222−--------------------------------------------------------------------------------
223−
224−--NB: Once you subscribe to an Event, you must always hold on the the WHOLE EventSubscription you get back
225−-- If you do not retain the subscription, you may be prematurely unsubscribed from the parent event.
226−data EventSubscription x = EventSubscription
227− { _eventSubscription_unsubscribe :: !(IO ())
228− , _eventSubscription_subscribed :: {-# UNPACK #-} !(EventSubscribed x)
229− }
230181
231−unsubscribe :: EventSubscription x -> IO ()
232−unsubscribe (EventSubscription u _) = u
182+{-# NOINLINE unsafeNodeId #-}
183+unsafeNodeId :: a -> Int
184+unsafeNodeId a = unsafePerformIO $ do
185+ touch a
186+ newNodeId
187+#endif
233188
234189--------------------------------------------------------------------------------
235190-- Event
236191--------------------------------------------------------------------------------
237192
238−newtype Event x a = Event { unEvent :: Subscriber x a -> EventM x (EventSubscription x, Maybe a) }
239−
240−{-# INLINE subscribeAndRead #-}
241−subscribeAndRead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
242−subscribeAndRead = unEvent
243−
244−{-# RULES
245−"cacheEvent/cacheEvent" forall e. cacheEvent (cacheEvent e) = cacheEvent e
246−"cacheEvent/pushCheap" forall f e. pushCheap f (cacheEvent e) = cacheEvent (pushCheap f e)
247−"hold/cacheEvent" forall f e. hold f (cacheEvent e) = hold f e
248− #-}
249−
250−-- | Construct an 'Event' equivalent to that constructed by 'push', but with no
251−-- caching; if the computation function is very cheap, this is (much) more
252−-- efficient than 'push'
253−{-# INLINE [1] pushCheap #-}
254−pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
255−pushCheap !f e = Event $ \sub -> do
256− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "push" $ sub
257− { subscriberPropagate = \a -> do
258− mb <- f a
259− mapM_ (subscriberPropagate sub) mb
260− }
261− occ' <- join <$> mapM f occ
262− return (subscription, occ')
263−
264−-- | A subscriber that never triggers other 'Event's
265−{-# INLINE terminalSubscriber #-}
266−terminalSubscriber :: (a -> EventM x ()) -> Subscriber x a
267−terminalSubscriber p = Subscriber
268− { subscriberPropagate = p
269− , subscriberInvalidateHeight = \_ -> return ()
270− , subscriberRecalculateHeight = \_ -> return ()
271− }
272−
273−-- | Subscribe to an Event only for the duration of one occurrence
274−{-# INLINE subscribeAndReadHead #-}
275−subscribeAndReadHead :: HasSpiderTimeline x => Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
276−subscribeAndReadHead e sub = do
277− subscriptionRef <- liftIO $ newIORef $ error "subscribeAndReadHead: not initialized"
278− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "head" $ sub
279− { subscriberPropagate = \a -> do
280− liftIO $ unsubscribe =<< readIORef subscriptionRef
281− subscriberPropagate sub a
282− }
283− liftIO $ case occ of
284− Nothing -> writeIORef subscriptionRef $! subscription
285− Just _ -> unsubscribe subscription
286− return (subscription, occ)
287−
288−--TODO: Make this lazy in its input event
289−headE :: (MonadIO m, Defer (SomeMergeInit x) m, HasSpiderTimeline x) => Event x a -> m (Event x a)
290−headE originalE = do
291− parent <- liftIO $ newIORef $ Just originalE
292− defer $ SomeMergeInit $ do --TODO: Rename SomeMergeInit appropriately
293− let clearParent = liftIO $ writeIORef parent Nothing
294− (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ const clearParent
295− when (isJust occ) clearParent
296− return $ Event $ \sub ->
297− liftIO (readIORef parent) >>= \case
298− Nothing -> subscribeAndReadNever
299− Just e -> subscribeAndReadHead e sub
300−
301−data CacheSubscribed x a
302− = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(FastWeakBag (Subscriber x a))
303− , _cacheSubscribed_parent :: {-# UNPACK #-} !(EventSubscription x)
304− , _cacheSubscribed_occurrence :: {-# UNPACK #-} !(IORef (Maybe a))
305−#ifdef DEBUG_NODEIDS
306− , _cacheSubscribed_nodeId :: {-# UNPACK #-} !Int
307−#endif
308− }
309−
310−nowSpiderEventM :: (HasSpiderTimeline x) => EventM x (R.Event (SpiderTimeline x) ())
311−nowSpiderEventM =
312− SpiderEvent <$> now
313−
314−now :: (MonadIO m, Defer (Some Clear) m, HasSpiderTimeline x
315− ) => m (Event x ())
316−now = do
317− nowOrNot <- liftIO $ newIORef $ Just ()
318− scheduleClear nowOrNot
319− return . Event $ \_ -> do
320− occ <- liftIO . readIORef $ nowOrNot
321− return ( EventSubscription (return ()) eventSubscribedNow
322− , occ
323− )
324−
325−-- | Construct an 'Event' whose value is guaranteed not to be recomputed
326−-- repeatedly
327−--
328−--TODO: Try a caching strategy where we subscribe directly to the parent when
329−--there's only one subscriber, and then build our own FastWeakBag only when a second
330−--subscriber joins
331−{-# NOINLINE [0] cacheEvent #-}
332−cacheEvent :: forall x a. HasSpiderTimeline x => Event x a -> Event x a
333−cacheEvent e =
334−#ifdef DEBUG_TRACE_EVENTS
335− withStackOneLine $ \callSite -> Event $
336−#else
337− Event $
338−#endif
339− unsafePerformIO $ do
340− mSubscribedRef :: IORef (FastWeak (CacheSubscribed x a))
341− <- newIORef emptyFastWeak
342− pure $ \sub -> {-# SCC "cacheEvent" #-} do
343−#ifdef DEBUG_TRACE_EVENTS
344− unless (BS8.null callSite) $ liftIO $ BS8.hPutStrLn stderr callSite
345−#endif
346− subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347− Just subscribedTicket -> return subscribedTicket
348− Nothing -> do
349−#ifdef DEBUG_NODEIDS
350− nodeId <- liftIO newNodeId
351−#endif
352− subscribers <- liftIO FastWeakBag.empty
353− occRef <- liftIO $ newIORef Nothing -- This should never be read prior to being set below
354−#ifdef DEBUG_NODEIDS
355− (parentSub, occ) <- subscribeAndRead e $ debugSubscriber' ("cacheEvent" <> showNodeId' nodeId) $ Subscriber
356−#else
357− (parentSub, occ) <- subscribeAndRead e $ Subscriber
358−#endif
359− { subscriberPropagate = \a -> do
360− liftIO $ writeIORef occRef (Just a)
361− scheduleClear occRef
362− propagateFast a subscribers
363− , subscriberInvalidateHeight = FastWeakBag.traverse_ subscribers . invalidateSubscriberHeight
364− , subscriberRecalculateHeight = FastWeakBag.traverse_ subscribers . recalculateSubscriberHeight
365− }
366− when (isJust occ) $ do
367− liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368− scheduleClear occRef
369− let !subscribed = CacheSubscribed
370− { _cacheSubscribed_subscribers = subscribers
371− , _cacheSubscribed_parent = parentSub
372− , _cacheSubscribed_occurrence = occRef
373−#ifdef DEBUG_NODEIDS
374− , _cacheSubscribed_nodeId = nodeId
375−#endif
376− }
377− subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378− liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379− return subscribedTicket
380− liftIO $ cacheSubscription sub mSubscribedRef subscribedTicket
381−
382−cacheSubscription :: Subscriber x a -> IORef (FastWeak (CacheSubscribed x a))
383− -> FastWeakTicket (CacheSubscribed x a) -> IO (EventSubscription x, Maybe a)
384−cacheSubscription sub mSubscribedRef subscribedTicket = do
385− subscribed <- getFastWeakTicketValue subscribedTicket
386− ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
387− occ <- readIORef $ _cacheSubscribed_occurrence subscribed
388−
389− let parentSub = _cacheSubscribed_parent subscribed
390− es = EventSubscription
391− { _eventSubscription_unsubscribe = do
392− FastWeakBag.remove ticket
393−
394− isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
395− when isEmpty $ do
396− writeIORef mSubscribedRef emptyFastWeak
397− unsubscribe parentSub
398− touch ticket
399− touch subscribedTicket
400− , _eventSubscription_subscribed = EventSubscribed
401− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub
402− , eventSubscribedRetained = toAny subscribedTicket
403−#ifdef DEBUG_CYCLES
404− , eventSubscribedGetParents = return [_eventSubscription_subscribed parentSub]
405− , eventSubscribedHasOwnHeightRef = False
406− , eventSubscribedWhoCreated = whoCreatedIORef mSubscribedRef
407−#endif
408− }
409− }
410− return (es, occ)
411−
193+newtype Event x a = Event { subscribeAndRead :: Subscriber x a -> EventM x (EventSubscription x a, Maybe a) }
412194
413−subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
195+subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x a)
414196subscribe e s = fst <$> subscribeAndRead e s
415197
416198{-# 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)
199+wrap :: MonadIO m => (t -> EventSubscribed x a) -> (Subscriber x a -> m (WeakBagTicket (Subscriber x a), t, Maybe a)) -> Subscriber x a -> m (EventSubscription x a, Maybe a)
418200wrap tag getSpecificSubscribed sub = do
419201 (sln, subd, occ) <- getSpecificSubscribed sub
420202 let es = tag subd
421− return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
203+ return (EventSubscription (Just sln) es, occ)
422204
423−eventRoot :: (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Event x a
205+eventRoot :: GCompare k => k a -> Root x k -> Event x a
424206eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
425207
426−subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427−subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428−
429208eventNever :: Event x a
430−eventNever = Event $ const subscribeAndReadNever
209+eventNever = Event $ \_ -> return (EventSubscription Nothing eventSubscribedNever, Nothing)
431210
432−eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
211+eventPush :: Push x b a -> Event x a
212+eventPush !p = Event $ wrap eventSubscribedPush $ getPushSubscribed p
213+
214+eventMerge :: (GCompare k, a ~ DMap k Identity) => Merge x k -> Event x a
215+eventMerge !m = Event $ wrap eventSubscribedMerge $ getMergeSubscribed m
216+
217+eventFan :: GCompare k => k a -> Fan x k -> Event x a
433218eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
434219
435−eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
220+eventSwitch :: Switch x a -> Event x a
436221eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
437222
438−eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
223+eventCoincidence :: Coincidence x a -> Event x a
439224eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
440225
441−eventHold :: Hold x p -> Event x p
226+eventHold :: a ~ p b => Hold x p b -> Event x a
442227eventHold !h = Event $ subscribeHoldEvent h
443228
444−eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
229+eventDyn :: (a ~ p b, R.Patch p) => Dyn x p b -> Event x a
445230eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
446231
232+eventHoldIdentity :: (a ~ Identity b) => Hold x Identity b -> Event x a
233+eventHoldIdentity !h = Event $ subscribeHoldEvent h
234+
235+eventDynIdentity :: (a ~ Identity b) => Dyn x Identity b -> Event x a
236+eventDynIdentity !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
237+
447238{-# INLINE subscribeCoincidenceInner #-}
448−subscribeCoincidenceInner :: HasSpiderTimeline x => Event x a -> Height -> CoincidenceSubscribed x a -> EventM x (Maybe a, Height, EventSubscribed x)
239+subscribeCoincidenceInner :: CanSubscribe x m => Event x a -> Height -> CoincidenceSubscribed x a -> m (Maybe a, Height, EventSubscribed x a)
449240subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
450241 subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
451242 (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
@@ -464,75 +255,171 @@ data Subscriber x a = Subscriber
464255 , subscriberRecalculateHeight :: !(Height -> IO ())
465256 }
466257
467−newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
258+--TODO: Move this comment to WeakBag
259+-- These function are constructor functions that are marked NOINLINE so they are
260+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
261+-- so any weak references that are attached to the constructors will have their
262+-- finalizer run. Using the opaque constructor, does not see the
263+-- constructor application, so it behaves like an IORef and cannot be fused away.
264+--
265+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
266+-- the weak pointer to it in some cases.
267+
268+newSubscriberPush :: (a -> ComputeM x (Maybe b)) -> PushSubscribed x a b -> IO (Subscriber x a)
269+newSubscriberPush compute subscribed = return $ Subscriber
270+ { subscriberPropagate = \a -> {-# SCC "traversePush" #-} do
271+ tracePropagate $ "SubscriberPush" <> showNodeId subscribed
272+ occ <- runComputeM $ compute a
273+ case occ of
274+ Nothing -> return () -- No need to write a Nothing back into the Ref
275+ Just o -> do
276+ liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
277+ scheduleClear $ pushSubscribedOccurrence subscribed
278+ propagate o $ pushSubscribedSubscribers subscribed
279+ , subscriberInvalidateHeight = \old -> do
280+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
281+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ invalidateSubscriberHeight old
282+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
283+ , subscriberRecalculateHeight = \new -> do
284+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
285+ WeakBag.traverse (pushSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
286+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
287+ }
288+
289+newSubscriberHold :: R.Patch p => Hold x p a -> IO (Subscriber x (p a))
468290newSubscriberHold h = return $ Subscriber
469291 { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
470292 , subscriberInvalidateHeight = \_ -> return ()
471293 , subscriberRecalculateHeight = \_ -> return ()
472294 }
473295
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
296+newSubscriberMerge :: GCompare k => k a -> MergeSubscribed x k -> IO (Subscriber x a)
297+newSubscriberMerge k subscribed = return $ Subscriber
298+ { subscriberPropagate = \a -> {-# SCC "traverseMerge" #-} do
299+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
300+ oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
301+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
302+ tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
303+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
304+ when (DMap.null oldM) $ do -- Only schedule the firing once
305+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
306+ --TODO: assertions about height
307+ currentHeight <- getCurrentHeight
308+ when (height <= currentHeight) $ do
309+ if height /= invalidHeight
310+ then do
311+ myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
312+ error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
313+ else liftIO $ do
314+#ifdef DEBUG_CYCLES
315+ nodesInvolvedInCycle <- walkInvalidHeightParents $ eventSubscribedMerge subscribed
316+ stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
317+ let cycleInfo = ":\n" <> drawForest (listsToForest stacks)
318+#else
319+ let cycleInfo = ""
320+#endif
321+ error $ "Causality loop found" <> cycleInfo
322+ scheduleMerge height subscribed
323+ , subscriberInvalidateHeight = \old -> do
324+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
325+ removeMergeHeight old subscribed
326+ invalidateMergeHeight subscribed
327+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
328+ , subscriberRecalculateHeight = \new -> do
329+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
330+ addMergeHeight new subscribed
331+ revalidateMergeHeight subscribed
332+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
333+ }
334+
335+newSubscriberMergeChange :: GCompare k => MergeSubscribed x k -> IO (Subscriber x (R.PatchDMap (DMap k (Event x))))
336+newSubscriberMergeChange subscribed = return $ Subscriber
337+ { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
338+ tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
339+ defer $ SomeMergeUpdate a subscribed
340+ , subscriberInvalidateHeight = \_ -> return ()
341+ , subscriberRecalculateHeight = \_ -> return ()
342+ }
343+
344+newSubscriberFan :: GCompare k => FanSubscribed x k -> IO (Subscriber x (DMap k Identity))
345+newSubscriberFan subscribed = return $ Subscriber
476346 { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
477347 subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
478− tracePropagate (Proxy :: Proxy x) $ show (DMap.size subs) <> " keys subscribed, " <> show (DMap.size a) <> " keys firing"
348+ tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
479349 liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
480350 scheduleClear $ fanSubscribedOccurrence subscribed
481− let f _ (Pair v subsubs) = do
351+ let f _ (Pair (Identity v) subsubs) = do
482352 propagate v $ _fanSubscribedChildren_list subsubs
483353 return $ Constant ()
484354 _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
485355 return ()
486356 , subscriberInvalidateHeight = \old -> do
357+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
487358 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
359+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
360+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
489361 , subscriberRecalculateHeight = \new -> do
362+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
490363 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
364+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
365+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
492366 }
493367
494−newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495−newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
368+newSubscriberSwitch :: SwitchSubscribed x a -> IO (Subscriber x a)
369+newSubscriberSwitch subscribed = return $ Subscriber
496370 { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
371+ tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
497372 liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
498373 scheduleClear $ switchSubscribedOccurrence subscribed
499374 propagate a $ switchSubscribedSubscribers subscribed
500375 , subscriberInvalidateHeight = \_ -> do
376+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
501377 oldHeight <- readIORef $ switchSubscribedHeight subscribed
502378 when (oldHeight /= invalidHeight) $ do
503379 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505− , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506− }
380+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
381+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
382+ , subscriberRecalculateHeight = \new -> do
383+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
384+ updateSwitchHeight new subscribed
385+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
386+ }
507387
508−newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
509−newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
388+newSubscriberCoincidenceOuter :: CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
389+newSubscriberCoincidenceOuter subscribed = return $ Subscriber
510390 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
391+ tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
511392 outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
512− tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
393+ tracePropagate $ " outerHeight = " <> show outerHeight
513394 (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−
395+ tracePropagate $ " isJust occ = " <> show (isJust occ)
396+ tracePropagate $ " innerHeight = " <> show innerHeight
517397 liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518398 scheduleClear $ coincidenceSubscribedInnerParent subscribed
519399 case occ of
520− Nothing ->
400+ Nothing -> do
521401 when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522402 writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
403+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
404+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525405 Just o -> do -- Since it's already firing, no need to adjust height
526406 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527407 scheduleClear $ coincidenceSubscribedOccurrence subscribed
528408 propagate o $ coincidenceSubscribedSubscribers subscribed
529− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
409+ , subscriberInvalidateHeight = \_ -> do
410+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
411+ invalidateCoincidenceHeight subscribed
412+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
413+ , subscriberRecalculateHeight = \_ -> do
414+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
415+ recalculateCoincidenceHeight subscribed
416+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
531417 }
532418
533−newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
534−newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoincidenceInner" <> showNodeId subscribed) $ Subscriber
419+newSubscriberCoincidenceInner :: CoincidenceSubscribed x a -> IO (Subscriber x a)
420+newSubscriberCoincidenceInner subscribed = return $ Subscriber
535421 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
422+ tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
536423 occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
537424 case occ of
538425 Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
@@ -540,8 +427,14 @@ newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoinciden
540427 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
541428 scheduleClear $ coincidenceSubscribedOccurrence subscribed
542429 propagate a $ coincidenceSubscribedSubscribers subscribed
543− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
430+ , subscriberInvalidateHeight = \_ -> do
431+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
432+ invalidateCoincidenceHeight subscribed
433+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
434+ , subscriberRecalculateHeight = \_ -> do
435+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
436+ recalculateCoincidenceHeight subscribed
437+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
545438 }
546439
547440invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
@@ -551,45 +444,30 @@ recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551444recalculateSubscriberHeight = flip subscriberRecalculateHeight
552445
553446-- | 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) $
447+propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
448+propagate a subscribers = withIncreasedDepth $ do
563449 -- 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
564450 --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
451+ WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
566452
567453--------------------------------------------------------------------------------
568454-- EventSubscribed
569455--------------------------------------------------------------------------------
570456
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
457+data EventSubscribed x a = forall b. EventSubscribed
580458 { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581− , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
459+ , eventSubscribedRetained :: {-# NOUNPACK #-} !b
582460#ifdef DEBUG_CYCLES
583− , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
461+ , eventSubscribedGetParents :: !(IO [Some (EventSubscribed x)]) -- For debugging loops
584462 , eventSubscribedHasOwnHeightRef :: !Bool
585463 , eventSubscribedWhoCreated :: !(IO [String])
586464#endif
587465 }
588466
589−eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x
467+eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x a
590468eventSubscribedRoot !r = EventSubscribed
591469 { eventSubscribedHeightRef = zeroRef
592− , eventSubscribedRetained = toAny r
470+ , eventSubscribedRetained = r
593471#ifdef DEBUG_CYCLES
594472 , eventSubscribedGetParents = return []
595473 , eventSubscribedHasOwnHeightRef = False
@@ -597,255 +475,149 @@ eventSubscribedRoot !r = EventSubscribed
597475#endif
598476 }
599477
600−eventSubscribedNever :: EventSubscribed x
478+eventSubscribedNever :: EventSubscribed x a
601479eventSubscribedNever = EventSubscribed
602480 { eventSubscribedHeightRef = zeroRef
603− , eventSubscribedRetained = toAny ()
481+ , eventSubscribedRetained = ()
604482#ifdef DEBUG_CYCLES
605483 , eventSubscribedGetParents = return []
606484 , eventSubscribedHasOwnHeightRef = False
607485 , eventSubscribedWhoCreated = return ["never"]
608486#endif
609487 }
610−eventSubscribedNow :: EventSubscribed x
611−eventSubscribedNow = EventSubscribed
612− { eventSubscribedHeightRef = zeroRef
613− , eventSubscribedRetained = toAny ()
488+
489+eventSubscribedPush :: PushSubscribed x b a -> EventSubscribed x a
490+eventSubscribedPush !subscribed = EventSubscribed
491+ { eventSubscribedHeightRef = pushSubscribedHeight subscribed
492+ , eventSubscribedRetained = subscribed
614493#ifdef DEBUG_CYCLES
615− , eventSubscribedGetParents = return []
494+ , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ pushSubscribedParent subscribed]
616495 , eventSubscribedHasOwnHeightRef = False
617− , eventSubscribedWhoCreated = return ["now"]
496+ , eventSubscribedWhoCreated = whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
497+#endif
498+ }
499+
500+eventSubscribedMerge :: MergeSubscribed x k -> EventSubscribed x a
501+eventSubscribedMerge !subscribed = EventSubscribed
502+ { eventSubscribedHeightRef = mergeSubscribedHeight subscribed
503+ , eventSubscribedRetained = subscribed
504+#ifdef DEBUG_CYCLES
505+ , eventSubscribedGetParents = do
506+ ps <- readIORef $ mergeSubscribedParents subscribed
507+ return $ R.ffor (DMap.toList ps) $ \(_ :=> v) -> Some.This $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription v
508+ , eventSubscribedHasOwnHeightRef = True
509+ , eventSubscribedWhoCreated = whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
618510#endif
619511 }
620512
621−eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
513+eventSubscribedFan :: FanSubscribed x k -> EventSubscribed x a
622514eventSubscribedFan !subscribed = EventSubscribed
623515 { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624− , eventSubscribedRetained = toAny subscribed
516+ , eventSubscribedRetained = subscribed
625517#ifdef DEBUG_CYCLES
626− , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
518+ , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
627519 , eventSubscribedHasOwnHeightRef = False
628520 , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
629521#endif
630522 }
631523
632−eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x
524+eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x a
633525eventSubscribedSwitch !subscribed = EventSubscribed
634526 { eventSubscribedHeightRef = switchSubscribedHeight subscribed
635− , eventSubscribedRetained = toAny subscribed
527+ , eventSubscribedRetained = subscribed
636528#ifdef DEBUG_CYCLES
637529 , eventSubscribedGetParents = do
638530 s <- readIORef $ switchSubscribedCurrentParent subscribed
639− return [_eventSubscription_subscribed s]
531+ return [Some.This $ _eventSubscription_subscribed s]
640532 , eventSubscribedHasOwnHeightRef = True
641533 , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
642534#endif
643535 }
644536
645−eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x
537+eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x a
646538eventSubscribedCoincidence !subscribed = EventSubscribed
647539 { eventSubscribedHeightRef = coincidenceSubscribedHeight subscribed
648− , eventSubscribedRetained = toAny subscribed
540+ , eventSubscribedRetained = subscribed
649541#ifdef DEBUG_CYCLES
650542 , eventSubscribedGetParents = do
651543 innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
652− let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653− innerParents = maybeToList $ innerSubscription
544+ let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
545+ innerParents = maybeToList $ fmap Some.This innerSubscription
654546 return $ outerParent : innerParents
655547 , eventSubscribedHasOwnHeightRef = True
656548 , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
657549#endif
658550 }
659551
660−getEventSubscribedHeight :: EventSubscribed x -> IO Height
552+getEventSubscribedHeight :: EventSubscribed x a -> IO Height
661553getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
662554
663555#ifdef DEBUG_CYCLES
664−whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
556+whoCreatedEventSubscribed :: EventSubscribed x a -> IO [String]
665557whoCreatedEventSubscribed = eventSubscribedWhoCreated
666558
667−walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
559+walkInvalidHeightParents :: EventSubscribed x a -> IO [Some (EventSubscribed x)]
668560walkInvalidHeightParents s0 = do
669− subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
561+ subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
670562 h <- liftIO $ readIORef $ eventSubscribedHeightRef s
671563 when (h == invalidHeight) $ do
672564 when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
673− modify (s :)
565+ modify (Some.This s :)
674566 mapM_ loop =<< liftIO (eventSubscribedGetParents s)
675− forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
567+ forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
676568 return subscribers
677569#endif
678570
679571{-# INLINE subscribeHoldEvent #-}
680−subscribeHoldEvent :: Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
572+subscribeHoldEvent :: CanSubscribe x m => Hold x p a -> Subscriber x (p a) -> m (EventSubscription x (p a), Maybe (p a))
681573subscribeHoldEvent = subscribeAndRead . holdEvent
682574
683575--------------------------------------------------------------------------------
684−-- Behavior
685−--------------------------------------------------------------------------------
686−
687−newtype Behavior x a = Behavior { readBehaviorTracked :: BehaviorM x a }
688−
689−behaviorHold :: Hold x p -> Behavior x (PatchTarget p)
690−behaviorHold !h = Behavior $ readHoldTracked h
691−
692−behaviorHoldIdentity :: Hold x (Identity a) -> Behavior x a
693−behaviorHoldIdentity = behaviorHold
694−
695−behaviorConst :: a -> Behavior x a
696−behaviorConst !a = Behavior $ return a
697−
698−behaviorPull :: Pull x a -> Behavior x a
699−behaviorPull !p = Behavior $ do
700− val <- liftIO $ readIORef $ pullValue p
701− case val of
702− Just subscribed -> do
703− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
704− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
705− liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
706− return $ pullSubscribedValue subscribed
707− Nothing -> do
708− i <- liftIO $ newInvalidatorPull p
709− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
710− parentsRef <- liftIO $ newIORef []
711− holdInits <- askBehaviorHoldInits
712− a <- liftIO $ runReaderIO (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
713− invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
714− parents <- liftIO $ readIORef parentsRef
715− let subscribed = PullSubscribed
716− { pullSubscribedValue = a
717− , pullSubscribedInvalidators = invsRef
718− , pullSubscribedOwnInvalidator = i
719− , pullSubscribedParents = parents
720− }
721− liftIO $ writeIORef (pullValue p) $ Just subscribed
722− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
723− return a
724−
725−behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
726−behaviorDyn !d = Behavior $ readHoldTracked =<< getDynHold d
727−
728−{-# INLINE readHoldTracked #-}
729−readHoldTracked :: Hold x p -> BehaviorM x (PatchTarget p)
730−readHoldTracked h = do
731− result <- liftIO $ readIORef $ holdValue h
732− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
733− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedHold h)) :))
734− liftIO $ touch h -- Otherwise, if this gets inlined enough, the hold's parent reference may get collected
735− return result
736−
737−{-# INLINABLE readBehaviorUntracked #-}
738−readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
739−readBehaviorUntracked b = do
740− holdInits <- getDeferralQueue
741− liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
742−
743−--------------------------------------------------------------------------------
744−-- Dynamic
576+-- EventSubscription
745577--------------------------------------------------------------------------------
746578
747−type DynamicS x p = Dynamic x (PatchTarget p) p
748−
749−data Dynamic x target p = Dynamic
750− { dynamicCurrent :: !(Behavior x target)
751− , dynamicUpdated :: Event x p -- This must be lazy; see the comment on holdEvent --TODO: Would this let us eliminate `Dyn`?
752− }
753−
754−deriving instance (HasSpiderTimeline x) => Functor (Dynamic x target)
755−
756−
757−
758−
759−dynamicHold :: Hold x p -> DynamicS x p
760−dynamicHold !h = Dynamic
761− { dynamicCurrent = behaviorHold h
762− , dynamicUpdated = eventHold h
763− }
764−
765−dynamicHoldIdentity :: Hold x (Identity a) -> DynamicS x (Identity a)
766−dynamicHoldIdentity = dynamicHold
767−
768−dynamicConst :: PatchTarget p -> DynamicS x p
769−dynamicConst !a = Dynamic
770− { dynamicCurrent = behaviorConst a
771− , dynamicUpdated = eventNever
579+data EventSubscription x a = EventSubscription
580+ { _eventSubscription_ticket :: !(Maybe (WeakBagTicket (Subscriber x a)))
581+ , _eventSubscription_subscribed :: !(EventSubscribed x a)
772582 }
773583
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
584+unsubscribe :: EventSubscription x a -> IO ()
585+unsubscribe (EventSubscription msln _) = forM_ msln $ \sln -> WeakBag.remove sln
782586
783587--------------------------------------------------------------------------------
784588-- Combinators
785589--------------------------------------------------------------------------------
786590
591+--TODO: Figure out why certain things are not 'representational', then make them
592+--representational so we can use coerce
593+
787594--type role Hold representational
788−data Hold x p
789− = Hold { holdValue :: !(IORef (PatchTarget p))
595+data Hold x p a
596+ = Hold { holdValue :: !(IORef a)
790597 , holdInvalidators :: !(IORef [Weak (Invalidator x)])
791− , holdEvent :: Event x p -- This must be lazy, or holds cannot be defined before their input Events
792− , holdParent :: !(IORef (Maybe (EventSubscription x))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
598+ , holdEvent :: !(Event x (p a))
599+ , holdParent :: !(IORef (Maybe (EventSubscription x (p a)))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
793600#ifdef DEBUG_NODEIDS
794601 , holdNodeId :: Int
795602#endif
796603 }
797604
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−
829605data EventEnv x
830− = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
606+ = EventEnv { eventEnvSpiderEnv :: !(SpiderEnv x)
607+ , eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
831608 , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
832− , eventEnvDynInits :: !(IORef [SomeDynInit x])
833609 , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
834610 , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
835− , eventEnvClears :: !(IORef [Some Clear]) -- Needed for Subscribe
836− , eventEnvIntClears :: !(IORef [Some IntClear])
837− , eventEnvRootClears :: !(IORef [Some RootClear])
611+ , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
612+ , eventEnvRootClears :: !(IORef [SomeRootClear])
838613 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
839614 , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
840− , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
615+ , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge x]))
841616 }
842617
843618{-# INLINE runEventM #-}
844−runEventM :: EventM x a -> IO a
845−runEventM = unEventM
846−
847−asksEventEnv :: forall x a. HasSpiderTimeline x => (EventEnv x -> a) -> EventM x a
848−asksEventEnv f = return $ f $ _spiderTimeline_eventEnv (unSTE (spiderTimeline :: SpiderTimelineEnv x))
619+runEventM :: EventM x a -> EventEnv x -> IO a
620+runEventM = runReaderT . unEventM
849621
850622class MonadIO m => Defer a m where
851623 getDeferralQueue :: m (IORef [a])
@@ -856,87 +628,81 @@ defer a = do
856628 q <- getDeferralQueue
857629 liftIO $ modifyIORef' q (a:)
858630
859−instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
631+instance Defer (SomeAssignment x) (EventM x) where
860632 {-# INLINE getDeferralQueue #-}
861− getDeferralQueue = asksEventEnv eventEnvAssignments
633+ getDeferralQueue = EventM $ asks eventEnvAssignments
862634
863−instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
635+instance Defer (SomeHoldInit x) (EventM x) where
864636 {-# INLINE getDeferralQueue #-}
865− getDeferralQueue = asksEventEnv eventEnvHoldInits
866−
867−instance HasSpiderTimeline x => Defer (SomeDynInit x) (EventM x) where
868− {-# INLINE getDeferralQueue #-}
869− getDeferralQueue = asksEventEnv eventEnvDynInits
637+ getDeferralQueue = EventM $ asks eventEnvHoldInits
870638
871639instance Defer (SomeHoldInit x) (BehaviorM x) where
872640 {-# INLINE getDeferralQueue #-}
873641 getDeferralQueue = BehaviorM $ asks snd
874642
875−instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
643+instance Defer (SomeMergeUpdate x) (EventM x) where
876644 {-# INLINE getDeferralQueue #-}
877− getDeferralQueue = asksEventEnv eventEnvMergeUpdates
645+ getDeferralQueue = EventM $ asks eventEnvMergeUpdates
878646
879−instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
647+instance Defer (SomeMergeInit x) (EventM x) where
880648 {-# INLINE getDeferralQueue #-}
881− getDeferralQueue = asksEventEnv eventEnvMergeInits
649+ getDeferralQueue = EventM $ asks eventEnvMergeInits
882650
883−class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
651+class HasCurrentHeight x m | m -> x where
884652 getCurrentHeight :: m Height
885− scheduleMerge :: Height -> EventM x () -> m ()
653+ scheduleMerge :: Height -> MergeSubscribed x a -> m ()
886654
887−instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
655+instance HasCurrentHeight x (EventM x) where
888656 {-# INLINE getCurrentHeight #-}
889− getCurrentHeight = do
890− heightRef <- asksEventEnv eventEnvCurrentHeight
657+ getCurrentHeight = EventM $ do
658+ heightRef <- asks eventEnvCurrentHeight
891659 liftIO $ readIORef heightRef
892660 {-# INLINE scheduleMerge #-}
893− scheduleMerge height subscribed = do
894− delayedRef <- asksEventEnv eventEnvDelayedMerges
895− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
661+ scheduleMerge height subscribed = EventM $ do
662+ delayedRef <- asks eventEnvDelayedMerges
663+ liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
896664
897−class HasSpiderTimeline x where
898− -- | Retrieve the current SpiderTimelineEnv
899− spiderTimeline :: SpiderTimelineEnv x
665+class HasSpiderEnv x m | m -> x where
666+ -- | Retrieve the current SpiderEnv
667+ askSpiderEnv :: m (SpiderEnv x)
900668
901−instance HasSpiderTimeline Global where
902− spiderTimeline = globalSpiderTimelineEnv
669+instance HasSpiderEnv x (EventM x) where
670+ {-# INLINE askSpiderEnv #-}
671+ askSpiderEnv = EventM $ asks eventEnvSpiderEnv
903672
904−putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
905−putCurrentHeight h = do
906− heightRef <- asksEventEnv eventEnvCurrentHeight
673+instance HasSpiderEnv x (SpiderHost x) where
674+ {-# INLINE askSpiderEnv #-}
675+ askSpiderEnv = SpiderHost ask
676+
677+putCurrentHeight :: Height -> EventM x ()
678+putCurrentHeight h = EventM $ do
679+ heightRef <- asks eventEnvCurrentHeight
907680 liftIO $ writeIORef heightRef $! h
908681
909−instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
682+instance Defer SomeClear (EventM x) where
910683 {-# INLINE getDeferralQueue #-}
911− getDeferralQueue = asksEventEnv eventEnvClears
684+ getDeferralQueue = EventM $ asks eventEnvClears
912685
913686{-# INLINE scheduleClear #-}
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
920−
921−{-# INLINE scheduleIntClear #-}
922−scheduleIntClear :: Defer (Some IntClear) m => IORef (IntMap a) -> m ()
923−scheduleIntClear r = defer $ Some $ IntClear r
687+scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
688+scheduleClear r = defer $ SomeClear r
924689
925−instance HasSpiderTimeline x => Defer (Some RootClear) (EventM x) where
690+instance Defer SomeRootClear (EventM x) where
926691 {-# INLINE getDeferralQueue #-}
927− getDeferralQueue = asksEventEnv eventEnvRootClears
692+ getDeferralQueue = EventM $ asks eventEnvRootClears
928693
929694{-# INLINE scheduleRootClear #-}
930−scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
931−scheduleRootClear r = defer $ Some $ RootClear r
695+scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
696+scheduleRootClear r = defer $ SomeRootClear r
932697
933−instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
698+instance Defer (SomeResetCoincidence x) (EventM x) where
934699 {-# INLINE getDeferralQueue #-}
935− getDeferralQueue = asksEventEnv eventEnvResetCoincidences
700+ getDeferralQueue = EventM $ asks eventEnvResetCoincidences
936701
937702-- Note: hold cannot examine its event until after the phase is over
938−{-# INLINE [1] hold #-}
939−hold :: (Patch p, Defer (SomeHoldInit x) m) => PatchTarget p -> Event x p -> m (Hold x p)
703+{-# SPECIALIZE hold :: R.Patch p => a -> Event x (p a) -> EventM x (Hold x p a) #-}
704+{-# SPECIALIZE hold :: R.Patch p => a -> Event x (p a) -> ComputeM x (Hold x p a) #-}
705+hold :: (R.Patch p, Defer (SomeHoldInit x) m) => a -> Event x (p a) -> m (Hold x p a)
940706hold v0 e = do
941707 valRef <- liftIO $ newIORef v0
942708 invsRef <- liftIO $ newIORef []
@@ -957,7 +723,7 @@ hold v0 e = do
957723 return h
958724
959725{-# INLINE getHoldEventSubscription #-}
960−getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
726+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))
961727getHoldEventSubscription h = do
962728 ep <- liftIO $ readIORef $ holdParent h
963729 case ep of
@@ -971,7 +737,7 @@ getHoldEventSubscription h = do
971737 Nothing -> return ()
972738 Just o -> do
973739 old <- liftIO $ readIORef $ holdValue h
974− case apply o old of
740+ case R.apply o old of
975741 Nothing -> return ()
976742 Just new -> do
977743 -- Need to evaluate these so that we don't retain the Hold itself
@@ -983,9 +749,9 @@ getHoldEventSubscription h = do
983749
984750type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
985751
752+--type role BehaviorM representational
986753-- BehaviorM can sample behaviors
987−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988− deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
754+newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderT (BehaviorEnv x) IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
989755
990756instance Monad (BehaviorM x) where
991757 {-# INLINE (>>=) #-}
@@ -994,16 +760,14 @@ instance Monad (BehaviorM x) where
994760 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995761 {-# INLINE return #-}
996762 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998763 {-# INLINE fail #-}
999764 fail s = BehaviorM $ fail s
1000−#endif
1001765
1002766data BehaviorSubscribed x a
1003− = forall p. BehaviorSubscribedHold (Hold x p)
767+ = forall p. BehaviorSubscribedHold (Hold x p a)
1004768 | BehaviorSubscribedPull (PullSubscribed x a)
1005769
1006−newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
770+data SomeBehaviorSubscribed x = forall a. SomeBehaviorSubscribed (BehaviorSubscribed x a)
1007771
1008772--type role PullSubscribed representational
1009773data PullSubscribed x a
@@ -1038,33 +802,55 @@ data RootSubscribed x a = forall k. GCompare k => RootSubscribed
1038802#endif
1039803 }
1040804
1041−data Root x k
805+data Root x (k :: * -> *)
1042806 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
1043807 , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
1044808 , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
1045809 }
1046810
1047−data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
811+data SomeHoldInit x = forall p a. R.Patch p => SomeHoldInit !(Hold x p a)
1048812
1049−data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
813+data SomeMergeUpdate x = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap (DMap k (Event x))) (MergeSubscribed x k)
1050814
1051−data SomeMergeUpdate x = SomeMergeUpdate
1052− { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
1053− , _someMergeUpdate_invalidateHeight :: !(IO ())
1054− , _someMergeUpdate_recalculateHeight :: !(IO ())
1055− }
815+data SomeMergeInit x = forall k. GCompare k => SomeMergeInit !(MergeSubscribed x k) !(Event x (R.PatchDMap (DMap k (Event x))))
1056816
1057−newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
817+data SomeEventSubscription x = forall a. SomeEventSubscription (EventSubscription x a)
1058818
1059819-- EventM can do everything BehaviorM can, plus create holds
1060−newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
820+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
821+
822+data PushSubscribed x a b
823+ = PushSubscribed { pushSubscribedCachedSubscribed :: !(IORef (Maybe (PushSubscribed x a b)))
824+ , 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)
825+ , pushSubscribedHeight :: !(IORef Height)
826+ , pushSubscribedSubscribers :: !(WeakBag (Subscriber x b))
827+ , pushSubscribedSelf :: !(Subscriber x a) -- Hold this in memory to ensure our WeakReferences don't die --TODO: Probably unneeded now
828+ , pushSubscribedWeakSelf :: !(IORef (Weak (PushSubscribed x a b)))
829+ , pushSubscribedParent :: !(EventSubscription x a)
830+#ifdef DEBUG_NODEIDS
831+ , pushSubscribedNodeId :: Int
832+#endif
833+ }
1061834
1062−newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
835+newtype ComputeM x a = ComputeM (ReaderT (IORef [SomeHoldInit x]) IO a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1063836
1064−data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
1065− { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
1066− , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
1067− }
837+instance Defer (SomeHoldInit x) (ComputeM x) where
838+ getDeferralQueue = ComputeM ask
839+
840+{-# SPECIALIZE runComputeM :: ComputeM x a -> EventM x a #-}
841+runComputeM :: Defer (SomeHoldInit x) m => ComputeM x a -> m a
842+runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
843+
844+data Push x a b
845+ = 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?)
846+ , pushParent :: !(Event x a)
847+ , pushSubscribed :: !(IORef (Maybe (PushSubscribed x a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
848+ }
849+
850+data MergeSubscribedParent (x :: *) k a = MergeSubscribedParent !(EventSubscription x a) !(Subscriber x a)
851+
852+mergeSubscribedParentSubscription :: MergeSubscribedParent x k a -> EventSubscription x a
853+mergeSubscribedParentSubscription (MergeSubscribedParent es _) = es
1068854
1069855data HeightBag = HeightBag
1070856 { _heightBag_size :: {-# UNPACK #-} !Int
@@ -1082,8 +868,7 @@ heightBagFromList :: [Height] -> HeightBag
1082868heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
1083869
1084870heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
871+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1087872
1088873heightBagRemove :: Height -> HeightBag -> HeightBag
1089874heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +877,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
1092877 0 -> IntMap.delete h c
1093878 _ -> IntMap.insert h (pred old) c
1094879
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−
1102880heightBagMax :: HeightBag -> Height
1103881heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
1104882 Just ((h, _), _) -> Height h
@@ -1116,25 +894,46 @@ heightBagVerify b@(HeightBag s c) = if
1116894heightBagVerify = id
1117895#endif
1118896
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)))
897+data MergeSubscribed x k
898+ = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed x k))) -- From the original merge
899+ , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
900+ , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
901+ , mergeSubscribedHeight :: !(IORef Height)
902+ , mergeSubscribedHeightBag :: !(IORef HeightBag)
903+ , mergeSubscribedSubscribers :: !(WeakBag (Subscriber x (DMap k Identity)))
904+ , mergeSubscribedChange :: !(IORef (Subscriber x (R.PatchDMap (DMap k (Event x))), EventSubscribed x (R.PatchDMap (DMap k (Event x)))))
905+ , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent x k)))
906+ , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed x k)))
907+#ifdef DEBUG_NODEIDS
908+ , mergeSubscribedNodeId :: Int
909+#endif
910+ }
911+
912+--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
913+data Merge x k
914+ = Merge { mergeParents :: !(Dynamic x R.PatchDMap (DMap k (Event x)))
915+ , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed x k)))
916+ }
917+
918+data FanSubscribedChildren (x :: *) k a = FanSubscribedChildren
919+ { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x a))
920+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k)
921+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k)))
1123922 }
1124923
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)
924+data FanSubscribed (x :: *) k
925+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
926+ , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
927+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k))) -- This DMap should never be empty
928+ , fanSubscribedParent :: !(EventSubscription x (DMap k Identity))
1130929#ifdef DEBUG_NODEIDS
1131930 , fanSubscribedNodeId :: Int
1132931#endif
1133932 }
1134933
1135−data Fan x k v
1136− = Fan { fanParent :: !(Event x (DMap k v))
1137− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
934+data Fan x k
935+ = Fan { fanParent :: !(Event x (DMap k Identity))
936+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
1138937 }
1139938
1140939data SwitchSubscribed x a
@@ -1146,7 +945,7 @@ data SwitchSubscribed x a
1146945 , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak (Invalidator x)))
1147946 , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed x])
1148947 , switchSubscribedParent :: !(Behavior x (Event x a))
1149− , switchSubscribedCurrentParent :: !(IORef (EventSubscription x))
948+ , switchSubscribedCurrentParent :: !(IORef (EventSubscription x a))
1150949 , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed x a)))
1151950#ifdef DEBUG_NODEIDS
1152951 , switchSubscribedNodeId :: Int
@@ -1158,17 +957,15 @@ data Switch x a
1158957 , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
1159958 }
1160959
1161−#ifdef USE_TEMPLATE_HASKELL
1162960{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1163−#endif
1164961data CoincidenceSubscribed x a
1165962 = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
1166963 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
1167964 , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
1168965 , coincidenceSubscribedHeight :: !(IORef Height)
1169966 , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber x (Event x a))
1170− , coincidenceSubscribedOuterParent :: !(EventSubscription x)
1171− , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x)))
967+ , coincidenceSubscribedOuterParent :: !(EventSubscription x (Event x a))
968+ , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x a)))
1172969 , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed x a)))
1173970#ifdef DEBUG_NODEIDS
1174971 , coincidenceSubscribedNodeId :: Int
@@ -1188,111 +985,152 @@ newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
1188985newInvalidatorPull :: Pull x a -> IO (Invalidator x)
1189986newInvalidatorPull p = return $! InvalidatorPull p
1190987
1191−instance HasSpiderTimeline x => Filterable (Event x) where
1192− mapMaybe f = push $ return . f
1193−
1194−instance HasSpiderTimeline x => Align (Event x) where
988+data Dynamic x p a
989+ = DynamicHold !(Hold x p a)
990+ | p ~ Identity => DynamicHoldIdentity !(Hold x Identity a)
991+ | DynamicConst !a
992+ | DynamicDyn !(Dyn x p a)
993+ | p ~ Identity => DynamicDynIdentity !(Dyn x Identity a)
994+
995+{-# INLINE current #-}
996+current :: R.Patch p => Dynamic x p a -> Behavior x a
997+current = \case
998+ DynamicHold h -> BehaviorHold h
999+ DynamicHoldIdentity h -> BehaviorHoldIdentity h
1000+ DynamicConst a -> BehaviorConst a
1001+ DynamicDyn d -> BehaviorDyn d
1002+ DynamicDynIdentity d -> BehaviorDynIdentity d
1003+
1004+--TODO: If you only need updated, not current, can we avoid actually constructing the Hold?
1005+{-# INLINE updated #-}
1006+updated :: R.Patch p => Dynamic x p a -> Event x (p a)
1007+updated = \case
1008+ DynamicHold h -> eventHold h
1009+ DynamicHoldIdentity h -> eventHoldIdentity h
1010+ DynamicConst _ -> eventNever
1011+ DynamicDyn d -> eventDyn d
1012+ DynamicDynIdentity d -> eventDynIdentity d
1013+
1014+newMapDyn :: (a -> b) -> Dynamic x Identity a -> Dynamic x Identity b
1015+newMapDyn f d = DynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ current d) (Identity . f . runIdentity <$> updated d)
1016+
1017+instance Functor (Dynamic x Identity) where
1018+ fmap = newMapDyn
1019+
1020+instance Applicative (Dynamic x Identity) where
1021+ pure = DynamicConst
1022+ (<*>) = zipDynWith ($)
1023+ _ *> b = b
1024+ a <* _ = a
1025+
1026+instance R.FunctorMaybe (Event x) where
1027+ fmapMaybe f = push $ return . f
1028+
1029+instance Align (Event x) where
11951030 nil = eventNever
1196−#if MIN_VERSION_these(0, 8, 0)
1197−instance HasSpiderTimeline x => Semialign (Event x) where
1198−#endif
1199− align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
1200− DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
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)
1031+ align ea eb = R.fmapMaybe R.dmapToThese $ merge $ DynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
12171032
12181033--TODO: Avoid the duplication between this and R.zipDynWith
1219−zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> DynamicS x (Identity a) -> DynamicS x (Identity b) -> DynamicS x (Identity c)
1034+zipDynWith :: (a -> b -> c) -> Dynamic x Identity a -> Dynamic x Identity b -> Dynamic x Identity c
12201035zipDynWith f da db =
1221− let eab = align (dynamicUpdated da) (dynamicUpdated db)
1036+ let eab = align (updated da) (updated db)
12221037 ec = flip push eab $ \o -> do
12231038 (a, b) <- case o of
12241039 This (Identity a) -> do
1225− b <- readBehaviorUntracked $ dynamicCurrent db
1040+ b <- readBehaviorUntracked $ current db
12261041 return (a, b)
12271042 That (Identity b) -> do
1228− a <- readBehaviorUntracked $ dynamicCurrent da
1043+ a <- readBehaviorUntracked $ current da
12291044 return (a, b)
12301045 These (Identity a) (Identity b) -> return (a, b)
12311046 return $ Just $ Identity $ f a b
1232− in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
1047+ in DynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (current da) <*> readBehaviorUntracked (current db)) ec
1048+
1049+instance Monad (Dynamic x Identity) where
1050+ {-# INLINE return #-}
1051+ return = pure
1052+ {-# INLINE (>>=) #-}
1053+ x >>= f = DynamicDynIdentity $ newJoinDyn $ newMapDyn f x --TODO: (>>), fail
1054+ {-# INLINE (>>) #-}
1055+ _ >> y = y
1056+ {-# INLINE fail #-}
1057+ fail _ = error "Dynamic does not support 'fail'"
12331058
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
1059+newtype Dyn x p a = Dyn { unDyn :: IORef (Either (BehaviorM x a, Event x (p a)) (Hold x p a)) }
12401060
1241−unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1242−unsafeBuildDynamic readV0 v' =
1243− Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
1061+unsafeDyn :: BehaviorM x a -> Event x (p a) -> Dyn x p a
1062+unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
1063+ where x = (readV0, v')
1064+
1065+newJoinDyn :: Dynamic x Identity (Dynamic x Identity a) -> Dyn x Identity a
1066+newJoinDyn d =
1067+ let readV0 = readBehaviorTracked . current =<< readBehaviorTracked (current d)
1068+ eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . current . runIdentity) $ updated d
1069+ eInner = switch $ updated <$> current d
1070+ eBoth = coincidence $ updated . runIdentity <$> updated d
1071+ v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
1072+ in unsafeDyn readV0 v'
1073+
1074+--type role Behavior representational
1075+data Behavior x a
1076+ = forall p. BehaviorHold !(Hold x p a)
1077+ | BehaviorHoldIdentity !(Hold x Identity a)
1078+ | BehaviorConst !a
1079+ | BehaviorPull !(Pull x a)
1080+ | BehaviorDynIdentity !(Dyn x Identity a)
1081+ | forall p. R.Patch p => BehaviorDyn !(Dyn x p a)
12441082
12451083-- ResultM can read behaviors and events
12461084type ResultM = EventM
12471085
1248−instance HasSpiderTimeline x => Functor (Event x) where
1086+{-# NOINLINE unsafeNewIORef #-}
1087+unsafeNewIORef :: a -> b -> IORef b
1088+unsafeNewIORef _ b = unsafePerformIO $ newIORef b
1089+
1090+instance Functor (Event x) where
12491091 fmap f = push $ return . Just . f
12501092
12511093instance Functor (Behavior x) where
12521094 fmap f = pull . fmap f . readBehaviorTracked
12531095
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)
1096+{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
1097+push :: (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
1098+push f e = eventPush $ Push
1099+ { pushCompute = f
1100+ , pushParent = e
1101+ , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
1102+ }
1103+-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
12571104
1258−{-# INLINABLE pull #-}
1105+{-# NOINLINE pull #-}
12591106pull :: BehaviorM x a -> Behavior x a
1260−pull a = unsafePerformIO $ do
1261− ref <- newIORef Nothing
1262−#ifdef DEBUG_NODEIDS
1263− nid <- newNodeId
1264−#endif
1265− pure $ behaviorPull $ Pull
1266− { pullCompute = a
1267− , pullValue = ref
1107+pull a = BehaviorPull $ Pull
1108+ { pullCompute = a
1109+ , pullValue = unsafeNewIORef a Nothing
12681110#ifdef DEBUG_NODEIDS
1269− , pullNodeId = nid
1111+ , pullNodeId = unsafeNodeId a
12701112#endif
1271− }
1113+ }
12721114
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− }
1115+{-# NOINLINE switch #-}
1116+switch :: Behavior x (Event x a) -> Event x a
1117+switch a = eventSwitch $ Switch
1118+ { switchParent = a
1119+ , switchSubscribed = unsafeNewIORef a Nothing
1120+ }
12811121
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− }
1122+coincidence :: Event x (Event x a) -> Event x a
1123+coincidence a = eventCoincidence $ Coincidence
1124+ { coincidenceParent = a
1125+ , coincidenceSubscribed = unsafeNewIORef a Nothing
1126+ }
12891127
12901128-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
1291−run :: forall x b. HasSpiderTimeline x => [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
1129+run :: [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
12921130run roots after = do
1293− tracePropagate (Proxy :: Proxy x) $ "Running an event frame with " <> show (length roots) <> " events"
1294− let t = spiderTimeline :: SpiderTimelineEnv x
1295− result <- SpiderHost $ withMVar (_spiderTimeline_lock (unSTE t)) $ \_ -> unSpiderHost $ runFrame $ do
1131+ tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
1132+ spiderEnv <- SpiderHost ask
1133+ result <- SpiderHost $ lift $ withMVar (_spiderEnv_lock spiderEnv) $ \_ -> flip runReaderT spiderEnv $ unSpiderHost $ runFrame $ do
12961134 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
12971135 occBefore <- liftIO $ do
12981136 occBefore <- readIORef occRef
@@ -1304,40 +1142,43 @@ run roots after = do
13041142 else return Nothing
13051143 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
13061144 propagate a subscribersRef
1307− delayedRef <- asksEventEnv eventEnvDelayedMerges
1145+ delayedRef <- EventM $ asks eventEnvDelayedMerges
13081146 let go = do
13091147 delayed <- liftIO $ readIORef delayedRef
13101148 case IntMap.minViewWithKey delayed of
13111149 Nothing -> return ()
13121150 Just ((currentHeight, cur), future) -> do
1313− tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
1151+ tracePropagate $ "Running height " ++ show currentHeight
13141152 putCurrentHeight $ Height currentHeight
13151153 liftIO $ writeIORef delayedRef $! future
1316− sequence_ cur
1154+ forM_ cur $ \d -> case d of
1155+ DelayedMerge subscribed -> do
1156+ height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
1157+ case height `compare` Height currentHeight of
1158+ LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1159+ GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1160+ EQ -> do
1161+ m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
1162+ liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! DMap.empty
1163+ --TODO: Assert that m is not empty
1164+ liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $ Just m
1165+ scheduleClear $ mergeSubscribedOccurrence subscribed
1166+ propagate m $ mergeSubscribedSubscribers subscribed
13171167 go
13181168 go
13191169 putCurrentHeight maxBound
13201170 after
1321− tracePropagate (Proxy :: Proxy x) "Done running an event frame"
1171+ tracePropagate "Done running an event frame"
13221172 return result
13231173
1324−scheduleMerge' :: HasSpiderTimeline x => Height -> IORef Height -> EventM x () -> EventM x ()
1325−scheduleMerge' initialHeight heightRef a = scheduleMerge initialHeight $ do
1326− height <- liftIO $ readIORef heightRef
1327− currentHeight <- getCurrentHeight
1328− case height `compare` currentHeight of
1329− LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1330− GT -> scheduleMerge' height heightRef a -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1331− EQ -> a
1332−
1333−newtype Clear a = Clear (IORef (Maybe a))
1334−
1335−newtype IntClear a = IntClear (IORef (IntMap a))
1174+data SomeClear = forall a. SomeClear (IORef (Maybe a))
13361175
1337−newtype RootClear k = RootClear (IORef (DMap k Identity))
1176+data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
13381177
13391178data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
13401179
1180+data DelayedMerge x = forall k. DelayedMerge (MergeSubscribed x k)
1181+
13411182debugFinalize :: Bool
13421183debugFinalize = False
13431184
@@ -1346,110 +1187,55 @@ mkWeakPtrWithDebug x debugNote = do
13461187 x' <- evaluate x
13471188 mkWeakPtr x' $
13481189 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
1190+ then Just $ putStrLn $ "finalizing: " ++ debugNote
13501191 else Nothing
13511192
13521193type WeakList a = [Weak a]
13531194
1354−type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
1195+{-# INLINE withIncreasedDepth #-}
1196+#ifdef DEBUG
1197+withIncreasedDepth :: CanTrace x m => m a -> m a
1198+withIncreasedDepth a = do
1199+ spiderEnv <- askSpiderEnv
1200+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) succ
1201+ result <- a
1202+ liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) pred
1203+ return result
1204+#else
1205+withIncreasedDepth :: m a -> m a
1206+withIncreasedDepth = id
1207+#endif
1208+
1209+type CanTrace x m = (HasSpiderEnv x m, MonadIO m)
13551210
1211+{-# INLINE tracePropagate #-}
1212+tracePropagate :: (CanTrace x m) => String -> m ()
1213+tracePropagate = traceWhen debugPropagate
13561214
1215+{-# INLINE traceInvalidate #-}
1216+traceInvalidate :: String -> IO ()
1217+traceInvalidate = when debugInvalidate . liftIO . putStrLn
13571218
1219+{-# INLINE traceWhen #-}
1220+traceWhen :: (CanTrace x m) => Bool -> String -> m ()
1221+traceWhen b message = traceMWhen b $ return message
13581222
1223+{-# INLINE traceMWhen #-}
1224+traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
1225+traceMWhen b getMessage = when b $ do
1226+ message <- getMessage
13591227#ifdef DEBUG
1228+ spiderEnv <- askSpiderEnv
1229+ d <- liftIO $ readIORef $ _spiderEnv_depth spiderEnv
1230+#else
1231+ let d = 0
1232+#endif
1233+ liftIO $ putStrLn $ replicate d ' ' <> message
13601234
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
1385− result <- a
1386− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
1387− return result
1388−
1389−{-# INLINE tracePropagate #-}
1390−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1391−tracePropagate p = when debugPropagate . trace p
1392−
1393−{-# INLINE traceInvalidate #-}
1394−traceInvalidate :: String -> IO ()
1395−traceInvalidate = when debugInvalidate . liftIO . debugStrLn
1396−
1397−{-# INLINE traceInvalidateHeight #-}
1398−traceInvalidateHeight :: String -> IO ()
1399−traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
1400−
1401−{-# INLINE trace #-}
1402−trace :: (CanTrace x m) => proxy x -> String -> m ()
1403−trace p message = traceM p $ return message
1404−
1405−{-# INLINE traceM #-}
1406−traceM :: forall x proxy m. (CanTrace x m) => proxy x -> m String -> m ()
1407−traceM _ getMessage = do
1408− message <- getMessage
1409− d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1410− liftIO $ debugStrLn $ replicate d ' ' <> message
1411−
1412−#else
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−
1448−#endif
1449−
1450−whoCreatedIORef :: IORef a -> IO [String]
1451−whoCreatedIORef (IORef a) = whoCreated $! a
1235+whoCreatedIORef :: IORef a -> IO [String]
1236+whoCreatedIORef (IORef a) = whoCreated $! a
14521237
1238+#ifdef DEBUG_CYCLES
14531239groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
14541240groupByHead = \case
14551241 [] -> []
@@ -1460,108 +1246,125 @@ groupByHead = \case
14601246 | otherwise -> (x, xs :| []) : l
14611247
14621248listsToForest :: Eq a => [[a]] -> Forest a
1463−listsToForest lists = buildForest <$> groupByHead (mapMaybe nonEmpty lists)
1464− where buildForest (a, lists') = Node a $ listsToForest $ toList lists'
1465−
1466−showStacks :: [[String]] -> String
1467−showStacks = drawForest . listsToForest . fmap (filterStack "Reflex.Spider.Internal")
1468−
1469−filterStack :: String -> [String] -> [String]
1470−#ifdef DEBUG_HIDE_INTERNALS
1471−filterStack prefix = filter (not . (prefix `isPrefixOf`))
1472−#else
1473−filterStack prefix = id
1249+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
14741250#endif
14751251
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
1496−
1497−
14981252{-# INLINE propagateSubscriberHold #-}
1499−propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
1253+propagateSubscriberHold :: R.Patch p => Hold x p a -> p a -> EventM x ()
15001254propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1255+ {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
15021256 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031257 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504−
15051258 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1506− case {-# SCC "apply" #-} apply a v of
1259+ case {-# SCC "apply" #-} R.apply a v of
15071260 Nothing -> return ()
15081261 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510− tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1262+ {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
15111263 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121264 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
15131265 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
15141266
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
1267+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
1268+
1269+{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> BehaviorM x a #-}
1270+{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> EventM x a #-}
1271+readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
1272+readBehaviorUntracked b = do
1273+ holdInits <- getDeferralQueue
1274+ liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
15161275
15171276runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1518−runBehaviorM a mwi holdInits = runReaderIO (unBehaviorM a) (mwi, holdInits)
1277+runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
15191278
15201279askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
15211280askInvalidator = do
1522− (!m, _) <- ask
1281+ (!m, _) <- BehaviorM ask
15231282 case m of
15241283 Nothing -> return Nothing
15251284 Just (!wi, _) -> return $ Just wi
15261285
15271286askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
15281287askParentsRef = do
1529− (!m, _) <- ask
1288+ (!m, _) <- BehaviorM ask
15301289 case m of
15311290 Nothing -> return Nothing
15321291 Just (_, !p) -> return $ Just p
15331292
15341293askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
15351294askBehaviorHoldInits = do
1536− (_, !his) <- ask
1295+ (_, !his) <- BehaviorM ask
15371296 return his
15381297
1298+readBehaviorTracked :: Behavior x a -> BehaviorM x a
1299+readBehaviorTracked b = case b of
1300+ BehaviorHold h -> readHoldTracked h
1301+ BehaviorHoldIdentity h -> readHoldTracked h
1302+ BehaviorConst a -> return a
1303+ BehaviorPull p -> do
1304+ val <- liftIO $ readIORef $ pullValue p
1305+ case val of
1306+ Just subscribed -> do
1307+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1308+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
1309+ liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
1310+ return $ pullSubscribedValue subscribed
1311+ Nothing -> do
1312+ i <- liftIO $ newInvalidatorPull p
1313+ wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
1314+ parentsRef <- liftIO $ newIORef []
1315+ holdInits <- askBehaviorHoldInits
1316+ a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
1317+ invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
1318+ parents <- liftIO $ readIORef parentsRef
1319+ let subscribed = PullSubscribed
1320+ { pullSubscribedValue = a
1321+ , pullSubscribedInvalidators = invsRef
1322+ , pullSubscribedOwnInvalidator = i
1323+ , pullSubscribedParents = parents
1324+ }
1325+ liftIO $ writeIORef (pullValue p) $ Just subscribed
1326+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1327+ return a
1328+ BehaviorDyn d -> readHoldTracked =<< getDynHold d
1329+ BehaviorDynIdentity d -> readHoldTracked =<< getDynHold d
1330+
1331+{-# INLINE readHoldTracked #-}
1332+readHoldTracked :: Hold x p a -> BehaviorM x a
1333+readHoldTracked h = do
1334+ result <- liftIO $ readIORef $ holdValue h
1335+ askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
1336+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
1337+ return result
1338+
15391339{-# INLINE getDynHold #-}
1540−getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
1340+getDynHold :: (Defer (SomeHoldInit x) m, R.Patch p) => Dyn x p a -> m (Hold x p a)
15411341getDynHold d = do
15421342 mh <- liftIO $ readIORef $ unDyn d
15431343 case mh of
1544− HoldDyn h -> return h
1545− UnsafeDyn (readV0, v') -> do
1344+ Right h -> return h
1345+ Left (readV0, v') -> do
15461346 holdInits <- getDeferralQueue
15471347 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
15541348 h <- hold v0 v'
1555− liftIO $ writeIORef (unDyn d) $ HoldDyn h
1349+ liftIO $ writeIORef (unDyn d) $ Right h
15561350 return h
15571351
1558−
15591352-- Always refers to 0
15601353{-# NOINLINE zeroRef #-}
15611354zeroRef :: IORef Height
15621355zeroRef = unsafePerformIO $ newIORef zeroHeight
15631356
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)
1357+type CanSubscribe x m =
1358+ ( HasSpiderEnv x m
1359+ , HasCurrentHeight x m
1360+ , Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m -- The things we need to lazily initialize state
1361+ , Defer SomeClear m -- Wiping out event firings
1362+ , Defer (SomeAssignment x) m -- Updating state
1363+ , Defer (SomeResetCoincidence x) m
1364+ , m ~ EventM x
1365+ )
1366+
1367+getRootSubscribed :: GCompare k => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a), RootSubscribed x a, Maybe a)
15651368getRootSubscribed k r sub = do
15661369 mSubscribed <- readIORef $ rootSubscribed r
15671370 let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
@@ -1575,15 +1378,10 @@ getRootSubscribed k r sub = do
15751378 let !cached = rootSubscribed r
15761379 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
15771380 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1578−
1579− tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580−
1381+ when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
15811382 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
15821383 writeIORef uninitRef $! uninit
1583−#ifdef DEBUG_NODEIDS
1584− nid <- newNodeId
1585−#endif
1586− let !subscribed = RootSubscribed
1384+ let subscribed = RootSubscribed
15871385 { rootSubscribedKey = k
15881386 , rootSubscribedCachedSubscribed = cached
15891387 , rootSubscribedOccurrence = getOcc
@@ -1591,120 +1389,143 @@ getRootSubscribed k r sub = do
15911389 , rootSubscribedUninit = uninit
15921390 , rootSubscribedWeakSelf = weakSelf
15931391#ifdef DEBUG_NODEIDS
1594− , rootSubscribedNodeId = nid
1392+ , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
15951393#endif
15961394 }
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)
1395+ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
16081396 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
16091397 occ <- getOcc
16101398 return (sln, subscribed, occ)
16111399
1612−#ifdef USE_TEMPLATE_HASKELL
16131400{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1614−#endif
16151401cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1616−cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
1402+cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
16171403 rootSubscribedUninit self
16181404 modifyIORef' cached $ DMap.delete k
16191405
16201406{-# INLINE subscribeRootSubscribed #-}
1621−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1407+subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
16221408subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
16231409
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))
1410+-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1411+{-# SPECIALIZE getPushSubscribed :: Push x a b -> Subscriber x b -> EventM x (WeakBagTicket (Subscriber x b), PushSubscribed x a b, Maybe b) #-}
1412+getPushSubscribed :: CanSubscribe x m => Push x a b -> Subscriber x b -> m (WeakBagTicket (Subscriber x b), PushSubscribed x a b, Maybe b)
1413+getPushSubscribed p sub = do
1414+ mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1415+ case mSubscribed of
1416+ Just subscribed -> {-# SCC "hitPush" #-} liftIO $ do
1417+ sln <- subscribePushSubscribed subscribed sub
1418+ occ <- readIORef $ pushSubscribedOccurrence subscribed
1419+ return (sln, subscribed, occ)
1420+ Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1421+ subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1422+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1423+ s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
1424+ (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead (pushParent p) s
1425+ occ <- runComputeM $ join <$> mapM (pushCompute p) parentOcc
1426+ occRef <- liftIO $ newIORef occ
1427+ when (isJust occ) $ scheduleClear occRef
1428+ weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1429+ let !cached = pushSubscribed p
1430+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1431+ let subscribed = PushSubscribed
1432+ { pushSubscribedCachedSubscribed = cached
1433+ , pushSubscribedOccurrence = occRef
1434+ , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1435+ , pushSubscribedSubscribers = subs
1436+ , pushSubscribedSelf = s
1437+ , pushSubscribedWeakSelf = weakSelf
1438+ , pushSubscribedParent = subscription
16301439#ifdef DEBUG_NODEIDS
1631− , _fanInt_nodeId :: {-# UNPACK #-} !Int
1440+ , pushSubscribedNodeId = unsafeNodeId p
16321441#endif
1633− }
1442+ }
1443+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1444+ liftIO $ writeIORef subscribedRef $! subscribed
1445+ liftIO $ writeIORef (pushSubscribed p) $ Just subscribed
1446+ return (sln, subscribed, occ)
16341447
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"
1640−#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1642−#endif
1643− return $ FanInt
1644− { _fanInt_subscribers = subscribers
1645− , _fanInt_subscriptionRef = subscriptionRef
1646− , _fanInt_occRef = occRef
1448+cleanupPushSubscribed :: PushSubscribed x a b -> IO ()
1449+cleanupPushSubscribed self = do
1450+ unsubscribe $ pushSubscribedParent self
1451+ writeIORef (pushSubscribedCachedSubscribed self) $ Nothing
1452+
1453+{-# INLINE subscribePushSubscribed #-}
1454+subscribePushSubscribed :: PushSubscribed x a b -> Subscriber x b -> IO (WeakBagTicket (Subscriber x b))
1455+subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1456+
1457+{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge x k -> Subscriber x (DMap k Identity) -> EventM x (WeakBagTicket (Subscriber x (DMap k Identity)), MergeSubscribed x k, Maybe (DMap k Identity)) #-}
1458+getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge x k -> Subscriber x (DMap k Identity) -> m (WeakBagTicket (Subscriber x (DMap k Identity)), MergeSubscribed x k, Maybe (DMap k Identity))
1459+getMergeSubscribed m sub = do
1460+ mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1461+ case mSubscribed of
1462+ Just subscribed -> {-# SCC "hitMerge" #-} liftIO $ do
1463+ sln <- subscribeMergeSubscribed subscribed sub
1464+ occ <- readIORef $ mergeSubscribedOccurrence subscribed
1465+ return (sln, subscribed, occ)
1466+ Nothing -> {-# SCC "missMerge" #-} do
1467+ subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1468+ subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1469+ initialParents <- readBehaviorUntracked $ current $ mergeParents m
1470+ subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent x k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1471+ s <- liftIO $ newSubscriberMerge k subscribedUnsafe
1472+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead e s
1473+ height <- liftIO $ getEventSubscribedHeight parentSubd
1474+ return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription s)
1475+ let dm = DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1476+ heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1477+ myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1478+ myHeight = if invalidHeight `elem` heights
1479+ then invalidHeight
1480+ else succHeight $ heightBagMax myHeightBag
1481+ currentHeight <- getCurrentHeight
1482+ let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1483+ then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1484+ else (Nothing, dm)
1485+ unless (DMap.null accum) $ do
1486+ scheduleMerge myHeight subscribedUnsafe
1487+ occRef <- liftIO $ newIORef occ
1488+ when (isJust occ) $ scheduleClear occRef
1489+ accumRef <- liftIO $ newIORef accum
1490+ heightRef <- liftIO $ newIORef myHeight
1491+ heightMapRef <- liftIO $ newIORef myHeightBag
1492+ weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1493+ (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1494+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1495+ parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1496+ let !subscribed = MergeSubscribed
1497+ { mergeSubscribedCachedSubscribed = mergeSubscribed m
1498+ , mergeSubscribedOccurrence = occRef
1499+ , mergeSubscribedAccum = accumRef
1500+ , mergeSubscribedHeight = heightRef
1501+ , mergeSubscribedHeightBag = heightMapRef
1502+ , mergeSubscribedSubscribers = subs
1503+ , mergeSubscribedChange = changeSubdRef
1504+ , mergeSubscribedParents = parentsRef
1505+ , mergeSubscribedWeakSelf = weakSelf
16471506#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1507+ , mergeSubscribedNodeId = unsafeNodeId m
16491508#endif
1650− }
1509+ }
1510+ defer $ SomeMergeInit subscribed $ updated $ mergeParents m
1511+ liftIO $ writeIORef subscribedRef $! subscribed
1512+ liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1513+ liftIO $ writeIORef (mergeSubscribed m) $ Just subscribed
1514+ return (sln, subscribed, occ)
16511515
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− }
1516+cleanupMergeSubscribed :: MergeSubscribed x k -> IO ()
1517+cleanupMergeSubscribed subscribed = do
1518+ parents <- readIORef $ mergeSubscribedParents subscribed
1519+ forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1520+ -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1521+ writeIORef (mergeSubscribedCachedSubscribed subscribed) $ Nothing -- Get rid of the cached subscribed
17041522
1523+{-# INLINE subscribeMergeSubscribed #-}
1524+subscribeMergeSubscribed :: MergeSubscribed x k -> Subscriber x (DMap k Identity) -> IO (WeakBagTicket (Subscriber x (DMap k Identity)))
1525+subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
17051526
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))
1527+{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan x k -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), FanSubscribed x k, Maybe a) #-}
1528+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 (WeakBagTicket (Subscriber x a), FanSubscribed x k, Maybe a)
17081529getFanSubscribed k f sub = do
17091530 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
17101531 case mSubscribed of
@@ -1722,16 +1543,13 @@ getFanSubscribed k f sub = do
17221543 subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
17231544 occRef <- liftIO $ newIORef parentOcc
17241545 when (isJust parentOcc) $ scheduleClear occRef
1725−#ifdef DEBUG_NODEIDS
1726− nid <- liftIO newNodeId
1727−#endif
17281546 let subscribed = FanSubscribed
17291547 { fanSubscribedCachedSubscribed = fanSubscribed f
17301548 , fanSubscribedOccurrence = occRef
17311549 , fanSubscribedParent = subscription
17321550 , fanSubscribedSubscribers = subscribersRef
17331551#ifdef DEBUG_NODEIDS
1734− , fanSubscribedNodeId = nid
1552+ , fanSubscribedNodeId = unsafeNodeId f
17351553#endif
17361554 }
17371555 let !self = (k, subscribed)
@@ -1741,7 +1559,7 @@ getFanSubscribed k f sub = do
17411559 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
17421560 return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
17431561
1744−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
1562+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k) -> IO ()
17451563cleanupFanSubscribed (k, subscribed) = do
17461564 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17471565 let reducedSubscribers = DMap.delete k subscribers
@@ -1753,7 +1571,7 @@ cleanupFanSubscribed (k, subscribed) = do
17531571 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
17541572
17551573{-# INLINE subscribeFanSubscribed #-}
1756−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
1574+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
17571575subscribeFanSubscribed k subscribed sub = do
17581576 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17591577 case DMap.lookup k subscribers of
@@ -1765,8 +1583,8 @@ subscribeFanSubscribed k subscribed sub = do
17651583 return sln
17661584 Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
17671585
1768−{-# INLINABLE getSwitchSubscribed #-}
1769−getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1586+{-# SPECIALIZE getSwitchSubscribed :: Switch x a -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), SwitchSubscribed x a, Maybe a) #-}
1587+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 (WeakBagTicket (Subscriber x a), SwitchSubscribed x a, Maybe a)
17701588getSwitchSubscribed s sub = do
17711589 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
17721590 case mSubscribed of
@@ -1791,9 +1609,6 @@ getSwitchSubscribed s sub = do
17911609 when (isJust parentOcc) $ scheduleClear occRef
17921610 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
17931611 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794−#ifdef DEBUG_NODEIDS
1795− nid <- liftIO newNodeId
1796−#endif
17971612 let !subscribed = SwitchSubscribed
17981613 { switchSubscribedCachedSubscribed = switchSubscribed s
17991614 , switchSubscribedOccurrence = occRef
@@ -1806,7 +1621,7 @@ getSwitchSubscribed s sub = do
18061621 , switchSubscribedCurrentParent = subscriptionRef
18071622 , switchSubscribedWeakSelf = weakSelf
18081623#ifdef DEBUG_NODEIDS
1809− , switchSubscribedNodeId = nid
1624+ , switchSubscribedNodeId = unsafeNodeId s
18101625#endif
18111626 }
18121627 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
@@ -1821,11 +1636,11 @@ cleanupSwitchSubscribed subscribed = do
18211636 writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
18221637
18231638{-# INLINE subscribeSwitchSubscribed #-}
1824−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1639+subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
18251640subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
18261641
1827−{-# INLINABLE getCoincidenceSubscribed #-}
1828−getCoincidenceSubscribed :: forall x a. HasSpiderTimeline x => Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
1642+{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), CoincidenceSubscribed x a, Maybe a) #-}
1643+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 (WeakBagTicket (Subscriber x a), CoincidenceSubscribed x a, Maybe a)
18291644getCoincidenceSubscribed c sub = do
18301645 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
18311646 case mSubscribed of
@@ -1851,9 +1666,6 @@ getCoincidenceSubscribed c sub = do
18511666 scheduleClear innerSubdRef
18521667 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
18531668 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854−#ifdef DEBUG_NODEIDS
1855− nid <- liftIO newNodeId
1856−#endif
18571669 let subscribed = CoincidenceSubscribed
18581670 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
18591671 , coincidenceSubscribedOccurrence = occRef
@@ -1864,7 +1676,7 @@ getCoincidenceSubscribed c sub = do
18641676 , coincidenceSubscribedInnerParent = innerSubdRef
18651677 , coincidenceSubscribedWeakSelf = weakSelf
18661678#ifdef DEBUG_NODEIDS
1867− , coincidenceSubscribedNodeId = nid
1679+ , coincidenceSubscribedNodeId = unsafeNodeId c
18681680#endif
18691681 }
18701682 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
@@ -1878,535 +1690,145 @@ cleanupCoincidenceSubscribed subscribed = do
18781690 writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
18791691
18801692{-# INLINE subscribeCoincidenceSubscribed #-}
1881−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1693+subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
18821694subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
18831695
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
1696+{-# INLINE merge #-}
1697+merge :: GCompare k => Dynamic x R.PatchDMap (DMap k (Event x)) -> Event x (DMap k Identity)
1698+merge m = eventMerge $ Merge
1699+ { mergeParents = m
1700+ , mergeSubscribed = unsafeNewIORef m Nothing
20951701 }
20961702
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−
22811703newtype 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) }
22831704
2284−fanG :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k v) -> EventSelectorG x k v
2285−fanG e = unsafePerformIO $ do
2286− ref <- newIORef Nothing
1705+fan :: GCompare k => Event x (DMap k Identity) -> EventSelector x k
1706+fan e =
22871707 let f = Fan
22881708 { fanParent = e
2289− , fanSubscribed = ref
1709+ , fanSubscribed = unsafeNewIORef e Nothing
22901710 }
2291− pure $ EventSelectorG $ \k -> eventFan k f
1711+ in EventSelector $ \k -> eventFan k f
22921712
2293−runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
2294−runHoldInits holdInitRef dynInitRef mergeInitRef = do
1713+runHoldInits :: IORef [SomeHoldInit x] -> IORef [SomeMergeInit x] -> EventM x ()
1714+runHoldInits holdInitRef mergeInitRef = do
22951715 holdInits <- liftIO $ readIORef holdInitRef
2296− dynInits <- liftIO $ readIORef dynInitRef
22971716 mergeInits <- liftIO $ readIORef mergeInitRef
2298− unless (null holdInits && null dynInits && null mergeInits) $ do
1717+ unless (null holdInits && null mergeInits) $ do
22991718 liftIO $ writeIORef holdInitRef []
2300− liftIO $ writeIORef dynInitRef []
23011719 liftIO $ writeIORef mergeInitRef []
23021720 mapM_ initHold holdInits
2303− mapM_ initDyn dynInits
2304− mapM_ unSomeMergeInit mergeInits
2305− runHoldInits holdInitRef dynInitRef mergeInitRef
1721+ mapM_ initMerge mergeInits
1722+ runHoldInits holdInitRef mergeInitRef
23061723
2307−initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
1724+initHold :: SomeHoldInit x -> EventM x ()
23081725initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
23091726
2310−initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
2311−initDyn (SomeDynInit d) = void $ getDynHold d
1727+initMerge :: SomeMergeInit x -> EventM x ()
1728+initMerge (SomeMergeInit subscribed changed) = do
1729+ changeSub <- liftIO $ newSubscriberMergeChange subscribed
1730+ (EventSubscription _ changeSubd, change) <- subscribeAndRead changed changeSub
1731+ forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1732+ liftIO $ writeIORef (mergeSubscribedChange subscribed) (changeSub, changeSubd)
23121733
2313−newEventEnv :: IO (EventEnv x)
2314−newEventEnv = do
1734+-- | Run an event action outside of a frame
1735+runFrame :: forall x a. EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1736+runFrame a = SpiderHost $ ask >>= \spiderEnv -> lift $ do
1737+ -- 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
1738+ pendingCleanups <- atomicModifyIORef (_spiderEnv_cleanups spiderEnv) $ \x -> ([], x)
1739+ {-# SCC "cleanups" #-} sequence_ pendingCleanups
23151740 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
23161741 holdInitRef <- newIORef []
2317− dynInitRef <- newIORef []
23181742 mergeUpdateRef <- newIORef []
23191743 mergeInitRef <- newIORef []
23201744 heightRef <- newIORef zeroHeight
23211745 toClearRef <- newIORef []
2322− toClearIntRef <- newIORef []
23231746 toClearRootRef <- newIORef []
23241747 coincidenceInfosRef <- newIORef []
2325− delayedRef <- newIORef IntMap.empty
2326− return $ EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef
2327−
2328−clearEventEnv :: EventEnv x -> IO ()
2329−clearEventEnv (EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef) = do
2330− writeIORef toAssignRef []
2331− writeIORef holdInitRef []
2332− writeIORef dynInitRef []
2333− writeIORef mergeUpdateRef []
2334− writeIORef mergeInitRef []
2335− writeIORef heightRef zeroHeight
2336− writeIORef toClearRef []
2337− writeIORef toClearIntRef []
2338− writeIORef toClearRootRef []
2339− writeIORef coincidenceInfosRef []
2340− writeIORef delayedRef IntMap.empty
2341−
2342−-- | Run an event action outside of a frame
2343−runFrame :: forall x a. HasSpiderTimeline x => EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
2344−runFrame a = SpiderHost $ do
2345− let env = _spiderTimeline_eventEnv $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1748+ delayedRef <- liftIO $ newIORef IntMap.empty
1749+ let env = EventEnv spiderEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
23461750 let go = do
23471751 result <- a
2348− runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
1752+ 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
23491753 return result
2350− result <- runEventM go
2351− toClear <- readIORef $ eventEnvClears env
2352− forM_ toClear $ \(Some (Clear ref)) -> {-# SCC "clear" #-} writeIORef ref Nothing
2353− toClearInt <- readIORef $ eventEnvIntClears env
2354− forM_ toClearInt $ \(Some (IntClear ref)) -> {-# SCC "intClear" #-} writeIORef ref $! IntMap.empty
2355− toClearRoot <- readIORef $ eventEnvRootClears env
2356− forM_ toClearRoot $ \(Some (RootClear ref)) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
2357− toAssign <- readIORef $ eventEnvAssignments env
1754+ result <- runEventM go env
1755+ toClear <- readIORef toClearRef
1756+ forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
1757+ toClearRoot <- readIORef toClearRootRef
1758+ forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1759+ toAssign <- readIORef toAssignRef
23581760 toReconnectRef <- newIORef []
2359− coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
1761+ coincidenceInfos <- readIORef coincidenceInfosRef
23601762 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
23611763 writeIORef vRef v
2362− traceInvalidate $ "Invalidating Hold"
1764+ when debugInvalidate $ putStrLn $ "Invalidating Hold"
23631765 writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
2364− mergeUpdates <- readIORef $ eventEnvMergeUpdates env
2365− writeIORef (eventEnvMergeUpdates env) []
2366− tracePropagate (Proxy::Proxy x) $ "Updating merges"
2367− mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
2368− tracePropagate (Proxy::Proxy x) $ "Updating merges done"
1766+ mergeUpdates <- readIORef mergeUpdateRef
1767+ writeIORef mergeUpdateRef []
1768+ let updateMerge :: SomeMergeUpdate x -> IO [SomeEventSubscription x]
1769+ updateMerge (SomeMergeUpdate (R.PatchDMap p :: R.PatchDMap (DMap k (Event x))) m) = do
1770+ oldParents <- readIORef $ mergeSubscribedParents m
1771+ let f (subscriptionsToKill, ps) (k :=> Compose me) = do
1772+ (mOldSubd, newPs) <- case me of
1773+ Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1774+ Just e -> do
1775+ s <- liftIO $ newSubscriberMerge k m
1776+ subscription@(EventSubscription _ subd) <- subscribe e s
1777+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
1778+ let newParent = MergeSubscribedParent subscription s
1779+ liftIO $ addMergeHeight newParentHeight m
1780+ return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1781+ forM_ mOldSubd $ \oldSubd -> do
1782+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1783+ liftIO $ removeMergeHeight oldHeight m
1784+ return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1785+ (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
1786+ writeIORef (mergeSubscribedParents m) $! newParents
1787+ return subscriptionsToKill
1788+ when debugPropagate $ putStrLn "Updating merges"
1789+ mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
1790+ when debugPropagate $ putStrLn "Updating merges done"
23691791 toReconnect <- readIORef toReconnectRef
2370− clearEventEnv env
23711792 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23721793 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
23731794 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2374− traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1795+ when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
23751796 finalize wi
23761797 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
23771798 wi' <- mkWeakPtrWithDebug i "wi'"
23781799 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
23791800 writeIORef (switchSubscribedBehaviorParents subscribed) []
2380− writeIORef (eventEnvHoldInits env) [] --TODO: Should we reuse this?
2381− e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) $ eventEnvHoldInits env
2382− runEventM $ runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) --TODO: Is this actually OK? It seems like it should be, since we know that no events are firing at this point, but it still seems inelegant
1801+ writeIORef holdInitRef [] --TODO: Should we reuse this?
1802+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
1803+ 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
23831804 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
23841805 sub <- newSubscriberSwitch subscribed
2385− subscription <- unSpiderHost $ runFrame $ {-# SCC "subscribeSwitch" #-} subscribe e sub --TODO: Assert that the event isn't firing --TODO: This should not loop because none of the events should be firing, but still, it is inefficient
1806+ 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
23861807 {-
23871808 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1809+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23891810 EventRoot _ -> "EventRoot"
23901811 EventNever -> "EventNever"
23911812 _ -> "something else"
23921813 -}
23931814 writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
2394− return oldSubscription
2395− liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
2396− liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
1815+ return $ SomeEventSubscription oldSubscription
1816+ forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1817+ forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
23971818 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23981819 EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
23991820 parentHeight <- getEventSubscribedHeight subd'
24001821 myHeight <- readIORef $ switchSubscribedHeight subscribed
24011822 when (parentHeight /= myHeight) $ do
24021823 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
2403− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
2404− mapM_ _someMergeUpdate_invalidateHeight mergeUpdates --TODO: In addition to when the patch is completely empty, we should also not run this if it has some Nothing values, but none of them have actually had any effect; potentially, we could even check for Just values with no effect (e.g. by comparing their IORefs and ignoring them if they are unchanged); actually, we could just check if the new height is different
1824+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1825+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> do
1826+ 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
24051827 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24061828 unsubscribe subscription
24071829 mapM_ invalidateCoincidenceHeight mcs
24081830 forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
2409− mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
1831+ forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> revalidateMergeHeight m
24101832 forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
24111833 height <- calculateSwitchHeight subscribed
24121834 updateSwitchHeight height subscribed
@@ -2436,12 +1858,50 @@ succHeight h@(Height a) =
24361858 then invalidHeight
24371859 else Height $ succ a
24381860
1861+removeMergeHeight :: Height -> MergeSubscribed x k -> IO ()
1862+removeMergeHeight oldParentHeight subscribed = do
1863+ when debugInvalidateHeight $ putStrLn $ "removeMergeHeight: " <> show oldParentHeight <> " Merge" <> showNodeId subscribed
1864+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1865+ let newHeights = heightBagRemove oldParentHeight oldHeights
1866+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1867+
1868+invalidateMergeHeight :: MergeSubscribed x k -> IO ()
1869+invalidateMergeHeight subscribed = do
1870+ oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1871+ -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1872+ when (oldHeight /= invalidHeight) $ do
1873+ writeIORef (mergeSubscribedHeight subscribed) $! invalidHeight
1874+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1875+
1876+addMergeHeight :: Height -> MergeSubscribed x k -> IO ()
1877+addMergeHeight newParentHeight subscribed = do
1878+ when debugInvalidateHeight $ putStrLn $ "addMergeHeight: " <> show newParentHeight <> " Merge" <> showNodeId subscribed
1879+ oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1880+ let newHeights = heightBagAdd newParentHeight oldHeights
1881+ writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1882+
1883+revalidateMergeHeight :: MergeSubscribed x k -> IO ()
1884+revalidateMergeHeight subscribed = do
1885+ currentHeight <- readIORef $ mergeSubscribedHeight subscribed
1886+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1887+ heights <- readIORef $ mergeSubscribedHeightBag subscribed
1888+ parents <- readIORef $ mergeSubscribedParents subscribed
1889+ -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1890+ case heightBagSize heights `compare` DMap.size parents of
1891+ LT -> return ()
1892+ EQ -> do
1893+ let height = succHeight $ heightBagMax heights
1894+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1895+ writeIORef (mergeSubscribedHeight subscribed) $! height
1896+ WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1897+ GT -> error $ "revalidateMergeHeight: more heights than parents for Merge" <> showNodeId subscribed
1898+
24391899invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
24401900invalidateCoincidenceHeight subscribed = do
24411901 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24421902 when (oldHeight /= invalidHeight) $ do
24431903 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1904+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
24451905
24461906updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
24471907updateSwitchHeight new subscribed = do
@@ -2449,7 +1909,7 @@ updateSwitchHeight new subscribed = do
24491909 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24501910 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24511911 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1912+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24531913
24541914recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
24551915recalculateCoincidenceHeight subscribed = do
@@ -2458,7 +1918,7 @@ recalculateCoincidenceHeight subscribed = do
24581918 height <- calculateCoincidenceHeight subscribed
24591919 when (height /= invalidHeight) $ do
24601920 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1921+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
24621922
24631923calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
24641924calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
@@ -2497,170 +1957,157 @@ invalidate toReconnectRef wis = do
24971957-- Reflex integration
24981958--------------------------------------------------------------------------------
24991959
2500−-- | Designates the default, global Spider timeline
2501−data SpiderTimeline x
2502−type role SpiderTimeline nominal
2503−
25041960-- | The default, global Spider environment
2505−type Spider = SpiderTimeline Global
2506−
2507−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
2508− {-# INLINABLE sample #-}
2509− sample (SpiderBehavior b) = readBehaviorUntracked b
1961+type Spider = SpiderEnv Global
25101962
2511−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (EventM x) where
2512− {-# INLINABLE hold #-}
2513− hold = holdSpiderEventM
2514− {-# INLINABLE holdDyn #-}
2515− holdDyn = holdDynSpiderEventM
2516− {-# INLINABLE holdIncremental #-}
2517− holdIncremental = holdIncrementalSpiderEventM
2518− {-# INLINABLE buildDynamic #-}
2519− buildDynamic = buildDynamicSpiderEventM
2520− {-# INLINABLE headE #-}
2521− headE = R.slowHeadE
2522−-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
2523− {-# INLINABLE now #-}
2524− now = nowSpiderEventM
2525−
2526−instance Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
2527− {-# INLINABLE sample #-}
2528− sample = coerce . readBehaviorTracked . unSpiderBehavior
1963+-- | Designates the default, global Spider timeline
1964+data Global
25291965
2530−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531− {-# INLINABLE sample #-}
2532− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
1966+{-# NOINLINE globalSpiderEnv #-}
1967+globalSpiderEnv :: SpiderEnv Global
1968+globalSpiderEnv = unsafePerformIO unsafeNewSpiderEnv
25331969
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
1970+-- | Stores all global data relevant to a particular Spider timeline; only one
1971+-- value should exist for each type @x@
1972+data SpiderEnv x = SpiderEnv
1973+ { _spiderEnv_toUnsubscribe :: !(IORef [SomeEventSubscription x])
1974+ , _spiderEnv_lock :: !(MVar ())
1975+ , _spiderEnv_cleanups :: !(IORef [IO ()])
1976+#ifdef DEBUG
1977+ , _spiderEnv_depth :: !(IORef Int)
1978+#endif
1979+ }
1980+type role SpiderEnv nominal
25481981
1982+instance GEq SpiderEnv where
1983+ a `geq` b = if _spiderEnv_lock a == _spiderEnv_lock b
1984+ then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderEnv can't have two different 'x' arguments
1985+ else Nothing
25491986
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'"
1987+unsafeNewSpiderEnv :: forall x. IO (SpiderEnv x)
1988+unsafeNewSpiderEnv = do
1989+ toUnsubscribe <- newIORef []
1990+ lock <- newMVar ()
1991+ cleanups <- newIORef []
1992+#ifdef DEBUG
1993+ depthRef <- newIORef 0
25601994#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)
1995+ return $ SpiderEnv
1996+ { _spiderEnv_toUnsubscribe = toUnsubscribe
1997+ , _spiderEnv_lock = lock
1998+ , _spiderEnv_cleanups = cleanups
1999+#ifdef DEBUG
2000+ , _spiderEnv_depth = depthRef
25842001#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
2002+ }
25882003
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
2004+-- | Create a new SpiderEnv
2005+newSpiderEnv :: IO (Some SpiderEnv)
2006+newSpiderEnv = Some.This <$> unsafeNewSpiderEnv
25912007
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
2008+newtype SpiderPullM x a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
25942009
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
2010+newtype SpiderPushM x a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
25972011
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
2012+instance R.Reflex (SpiderEnv x) where
2013+ newtype Behavior (SpiderEnv x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
2014+ newtype Event (SpiderEnv x) a = SpiderEvent { unSpiderEvent :: Event x a }
2015+ newtype Dynamic (SpiderEnv x) a = SpiderDynamic { unSpiderDynamic :: Dynamic x Identity a } deriving (Functor, Applicative, Monad)
2016+ newtype Incremental (SpiderEnv x) p a = SpiderIncremental { unSpiderIncremental :: Dynamic x p a }
2017+ type PullM (SpiderEnv x) = SpiderPullM x
2018+ type PushM (SpiderEnv x) = SpiderPushM x
2019+ {-# INLINABLE never #-}
2020+ never = SpiderEvent eventNever
2021+ {-# INLINABLE constant #-}
2022+ constant = SpiderBehavior . BehaviorConst
2023+ {-# INLINABLE push #-}
2024+ push f = SpiderEvent . push (coerce f) . unSpiderEvent
2025+ {-# INLINABLE pull #-}
2026+ pull = SpiderBehavior . pull . coerce
2027+ {-# INLINABLE merge #-}
2028+ merge = SpiderEvent . merge . DynamicConst . (unsafeCoerce :: DMap k (R.Event (SpiderEnv x)) -> DMap k (Event x))
2029+ {-# INLINABLE fan #-}
2030+ fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
2031+ {-# INLINABLE switch #-}
2032+ switch = SpiderEvent . switch . (unsafeCoerce :: Behavior x (R.Event (SpiderEnv x) a) -> Behavior x (Event x a)) . unSpiderBehavior
2033+ {-# INLINABLE coincidence #-}
2034+ coincidence = SpiderEvent . coincidence . (unsafeCoerce :: Event x (R.Event (SpiderEnv x) a) -> Event x (Event x a)) . unSpiderEvent
2035+ {-# INLINABLE current #-}
2036+ current = SpiderBehavior . current . unSpiderDynamic
2037+ {-# INLINABLE updated #-}
2038+ updated = SpiderEvent . fmap runIdentity . updated . unSpiderDynamic
2039+ {-# INLINABLE unsafeBuildDynamic #-}
2040+ unsafeBuildDynamic readV0 v' = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (coerce readV0) $ addIdentity $ unSpiderEvent v'
2041+ {-# INLINABLE unsafeBuildIncremental #-}
2042+ unsafeBuildIncremental readV0 dv = SpiderIncremental $ DynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
2043+ {-# INLINABLE mergeIncremental #-}
2044+ mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic x R.PatchDMap (DMap k (R.Event (SpiderEnv x))) -> Dynamic x R.PatchDMap (DMap k (Event x))) . unSpiderIncremental
2045+ {-# INLINABLE currentIncremental #-}
2046+ currentIncremental = SpiderBehavior . current . unSpiderIncremental
2047+ {-# INLINABLE updatedIncremental #-}
2048+ updatedIncremental = SpiderEvent . updated . unSpiderIncremental
2049+ {-# INLINABLE incrementalToDynamic #-}
2050+ incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ current i) $ flip push (updated i) $ \p -> do
2051+ c <- readBehaviorUntracked $ current i
2052+ return $ Identity <$> R.apply p c --TODO: Avoid the redundant 'apply'
26002053
2601−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
2054+instance R.MonadSample (SpiderEnv x) (EventM x) where
2055+ {-# INLINABLE sample #-}
2056+ sample (SpiderBehavior b) = readBehaviorUntracked b
2057+
2058+instance R.MonadHold (SpiderEnv x) (EventM x) where
26022059 {-# INLINABLE hold #-}
2603− hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
2060+ hold = holdSpiderEventM
26042061 {-# INLINABLE holdDyn #-}
2605− holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
2062+ holdDyn = holdDynSpiderEventM
26062063 {-# INLINABLE holdIncremental #-}
2607− holdIncremental v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdIncremental v0 e
2608− {-# INLINABLE buildDynamic #-}
2609− buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
2610− {-# INLINABLE headE #-}
2611− headE e = runFrame . runSpiderHostFrame $ Reflex.Class.headE e
2612− {-# INLINABLE now #-}
2613− now = runFrame . runSpiderHostFrame $ Reflex.Class.now
2614−
2615−
2616−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
2617− sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2064+ holdIncremental = holdIncrementalSpiderEventM
2065+
2066+holdSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Behavior (SpiderEnv x) a)
2067+holdSpiderEventM v0 e = fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2068+
2069+holdDynSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Dynamic (SpiderEnv x) a)
2070+holdDynSpiderEventM v0 e = fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2071+
2072+holdIncrementalSpiderEventM :: R.Patch p => a -> R.Event (SpiderEnv x) (p a) -> EventM x (R.Incremental (SpiderEnv x) p a)
2073+holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
26182074
2619−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2075+instance R.MonadHold (SpiderEnv x) (SpiderHost x) where
26202076 {-# INLINABLE hold #-}
2621− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2077+ hold v0 e = R.runHostFrame $ R.hold v0 e
26222078 {-# INLINABLE holdDyn #-}
2623− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2079+ holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
26242080 {-# 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
2081+ holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
2082+
2083+instance R.MonadSample (SpiderEnv x) (SpiderHost x) where
26352084 {-# INLINABLE sample #-}
26362085 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
26372086
2638−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2087+instance R.MonadSample (SpiderEnv x) (SpiderPullM x) where
26392088 {-# INLINABLE sample #-}
2640− sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
2089+ sample = coerce . readBehaviorTracked . unSpiderBehavior
2090+
2091+instance R.MonadSample (SpiderEnv x) (SpiderPushM x) where
2092+ {-# INLINABLE sample #-}
2093+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
26412094
2642−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2095+instance R.MonadHold (SpiderEnv x) (SpiderPushM x) where
26432096 {-# INLINABLE hold #-}
2644− hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
2097+ hold v0 e = R.current <$> R.holdDyn v0 e
26452098 {-# INLINABLE holdDyn #-}
2646− holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
2099+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity e
26472100 {-# INLINABLE holdIncremental #-}
2648− holdIncremental v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdIncremental v0 e
2649− {-# INLINABLE buildDynamic #-}
2650− buildDynamic getV0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.buildDynamic getV0 e
2651− {-# INLINABLE headE #-}
2652− headE e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.headE e
2653− {-# INLINABLE now #-}
2654− now = Reflex.Spider.Internal.ReadPhase Reflex.Class.now
2101+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . DynamicHold <$> hold v0 e
26552102
2656−--------------------------------------------------------------------------------
2657−-- Deprecated items
2658−--------------------------------------------------------------------------------
2103+data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
26592104
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
2105+data SpiderEventHandle x a = SpiderEventHandle
2106+ { spiderEventHandleSubscription :: EventSubscription x a
2107+ , spiderEventHandleValue :: IORef (Maybe a)
2108+ }
2109+
2110+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHostFrame x) where
26642111 {-# INLINABLE subscribeEvent #-}
26652112 subscribeEvent e = SpiderHostFrame $ do
26662113 --TODO: Unsubscribe eventually (manually and/or with weak ref)
@@ -2677,149 +2124,18 @@ instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTim
26772124 , spiderEventHandleValue = val
26782125 }
26792126
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
2127+instance R.ReflexHost (SpiderEnv x) where
2128+ type EventTrigger (SpiderEnv x) = RootTrigger x
2129+ type EventHandle (SpiderEnv x) = SpiderEventHandle x
2130+ type HostFrame (SpiderEnv x) = SpiderHostFrame x
26842131
2685−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2132+instance R.MonadReadEvent (SpiderEnv x) (ReadPhase x) where
26862133 {-# NOINLINE readEvent #-}
2687− readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
2134+ readEvent h = ReadPhase $ fmap (fmap return) $ liftIO $ do
26882135 result <- readIORef $ spiderEventHandleValue h
26892136 touch h
26902137 return result
26912138
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−
28232139instance MonadRef (EventM x) where
28242140 type Ref (EventM x) = Ref IO
28252141 {-# INLINABLE newRef #-}
@@ -2834,7 +2150,7 @@ instance MonadAtomicRef (EventM x) where
28342150 atomicModifyRef r f = liftIO $ atomicModifyRef r f
28352151
28362152-- | The monad for actions that manipulate a Spider timeline identified by @x@
2837−newtype SpiderHost (x :: Type) a = SpiderHost { unSpiderHost :: IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2153+newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28382154
28392155instance Monad (SpiderHost x) where
28402156 {-# INLINABLE (>>=) #-}
@@ -2843,27 +2159,15 @@ instance Monad (SpiderHost x) where
28432159 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442160 {-# INLINABLE return #-}
28452161 return x = SpiderHost $ return x
2846−#if !MIN_VERSION_base(4,13,0)
28472162 {-# INLINABLE fail #-}
2848− fail = MonadFail.fail
2849−#endif
2850−
2851−instance MonadFail (SpiderHost x) where
2852− {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2163+ fail s = SpiderHost $ fail s
28542164
28552165-- | Run an action affecting the global Spider timeline; this will be guarded by
28562166-- a mutex for that timeline
28572167runSpiderHost :: SpiderHost Global a -> IO a
2858−runSpiderHost (SpiderHost a) = a
2859−
2860−-- | Run an action affecting a given Spider timeline; this will be guarded by a
2861−-- mutex for that timeline
2862−runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimelineEnv x -> IO a
2863−runSpiderHostForTimeline (SpiderHost a) _ = a
2168+runSpiderHost (SpiderHost a) = runReaderT a globalSpiderEnv
28642169
2865−newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866− deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2170+newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28672171
28682172instance Monad (SpiderHostFrame x) where
28692173 {-# INLINABLE (>>=) #-}
@@ -2872,21 +2176,30 @@ instance Monad (SpiderHostFrame x) where
28722176 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732177 {-# INLINABLE return #-}
28742178 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762179 {-# INLINABLE fail #-}
28772180 fail s = SpiderHostFrame $ fail s
2878−#endif
28792181
2880−instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2881− notReadyUntil _ = pure ()
2882− notReady = pure ()
2182+instance R.MonadSample (SpiderEnv x) (SpiderHostFrame x) where
2183+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2184+
2185+addIdentity :: Event x a -> Event x (Identity a)
2186+--addIdentity = fmap Identity
2187+addIdentity = unsafeCoerce
2188+
2189+instance R.MonadHold (SpiderEnv x) (SpiderHostFrame x) where
2190+ {-# INLINABLE hold #-}
2191+ hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2192+ {-# INLINABLE holdDyn #-}
2193+ holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2194+ {-# INLINABLE holdIncremental #-}
2195+ holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
28832196
2884−newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2197+newEventWithTriggerIO :: (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
28852198newEventWithTriggerIO f = do
28862199 es <- newFanEventWithTriggerIO $ \Refl -> f
28872200 return $ select es Refl
28882201
2889−newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2202+newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
28902203newFanEventWithTriggerIO f = do
28912204 occRef <- newIORef DMap.empty
28922205 subscribedRef <- newIORef DMap.empty
@@ -2897,8 +2210,41 @@ newFanEventWithTriggerIO f = do
28972210 }
28982211 return $ EventSelector $ \k -> eventRoot k r
28992212
2213+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHost x) where
2214+ newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
2215+ newFanEventWithTrigger f = SpiderHost $ lift $ do
2216+ es <- newFanEventWithTriggerIO f
2217+ return $ R.EventSelector $ SpiderEvent . select es
2218+
2219+instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHostFrame x) where
2220+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2221+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2222+ es <- newFanEventWithTriggerIO f
2223+ return $ R.EventSelector $ SpiderEvent . select es
2224+
2225+instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHost x) where
2226+ {-# INLINABLE subscribeEvent #-}
2227+ subscribeEvent = runFrame . runSpiderHostFrame . R.subscribeEvent
2228+
29002229newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
29012230
2231+instance R.MonadSample (SpiderEnv x) (ReadPhase x) where
2232+ {-# INLINABLE sample #-}
2233+ sample = ReadPhase . R.sample
2234+
2235+instance R.MonadHold (SpiderEnv x) (ReadPhase x) where
2236+ {-# INLINABLE hold #-}
2237+ hold v0 e = ReadPhase $ R.hold v0 e
2238+ {-# INLINABLE holdDyn #-}
2239+ holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2240+ {-# INLINABLE holdIncremental #-}
2241+ holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2242+
2243+instance R.MonadReflexHost (SpiderEnv x) (SpiderHost x) where
2244+ type ReadPhase (SpiderHost x) = ReadPhase x
2245+ fireEventsAndRead es (ReadPhase a) = run es a
2246+ runHostFrame = runFrame . runSpiderHostFrame
2247+
29022248instance MonadRef (SpiderHost x) where
29032249 type Ref (SpiderHost x) = Ref IO
29042250 newRef = SpiderHost . newRef
@@ -2916,15 +2262,3 @@ instance MonadRef (SpiderHostFrame x) where
29162262
29172263instance MonadAtomicRef (SpiderHostFrame x) where
29182264 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 ()