slightly higher-level thread scheduling code
Including support for unbound thread sleeping. Haskell's max thread sleep is 37 minutes, due to maxBound Int!
This commit is contained in:
parent
24370fa3ac
commit
36d73b0017
1 changed files with 42 additions and 0 deletions
42
Utility/ThreadScheduler.hs
Normal file
42
Utility/ThreadScheduler.hs
Normal file
|
@ -0,0 +1,42 @@
|
||||||
|
{- thread scheduling
|
||||||
|
-
|
||||||
|
- Copyright 2012 Joey Hess <joey@kitenet.net>
|
||||||
|
- Copyright 2011 Bas van Dijk & Roel van Dijk
|
||||||
|
-
|
||||||
|
- Licensed under the GNU GPL version 3 or higher.
|
||||||
|
-}
|
||||||
|
|
||||||
|
module Utility.ThreadScheduler where
|
||||||
|
|
||||||
|
import Common
|
||||||
|
import Control.Concurrent
|
||||||
|
|
||||||
|
newtype Seconds = Seconds { fromSeconds :: Int }
|
||||||
|
deriving (Eq, Ord, Show)
|
||||||
|
|
||||||
|
{- Runs an action repeatedly forever, sleeping at least the specified number
|
||||||
|
- of seconds in between. -}
|
||||||
|
runEvery :: Seconds -> IO a -> IO a
|
||||||
|
runEvery n a = forever $ do
|
||||||
|
threadDelaySeconds n
|
||||||
|
a
|
||||||
|
|
||||||
|
threadDelaySeconds :: Seconds -> IO ()
|
||||||
|
threadDelaySeconds (Seconds n) = unboundDelay (fromIntegral n * oneSecond)
|
||||||
|
where
|
||||||
|
oneSecond = 1000000 -- microseconds
|
||||||
|
|
||||||
|
{- Like threadDelay, but not bounded by an Int.
|
||||||
|
-
|
||||||
|
- There is no guarantee that the thread will be rescheduled promptly when the
|
||||||
|
- delay has expired, but the thread will never continue to run earlier than
|
||||||
|
- specified.
|
||||||
|
-
|
||||||
|
- Taken from the unbounded-delay package to avoid a dependency for 4 lines
|
||||||
|
- of code.
|
||||||
|
-}
|
||||||
|
unboundDelay :: Integer -> IO ()
|
||||||
|
unboundDelay time = do
|
||||||
|
let maxWait = min time $ toInteger (maxBound :: Int)
|
||||||
|
threadDelay $ fromInteger maxWait
|
||||||
|
when (maxWait /= time) $ unboundDelay (time - maxWait)
|
Loading…
Add table
Add a link
Reference in a new issue