1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283
|
{-# LANGUAGE BangPatterns, CPP, ScopedTypeVariables #-}
module General.Base(
Lock, newLock, withLock, withLockTry,
Var, newVar, readVar, modifyVar, modifyVar_, withVar,
Barrier, newBarrier, signalBarrier, waitBarrier, waitBarrierMaybe,
Duration, duration, Time, offsetTime, sleep,
isWindows, getProcessorCount,
readFileUCS2, getEnvMaybe, captureOutput,
showDP, showTime,
modifyIORef'', writeIORef'',
whenJust, loopM, whileM, partitionM, concatMapM, mapMaybeM, liftA2',
fastNub, showQuote, word1,
withBufferMode, withCapabilities
) where
import Control.Applicative
import Control.Arrow
import Control.Concurrent
import Control.Exception
import Control.Monad
import Data.Char
import Data.IORef
import Data.List
import Data.Maybe
import Data.Time
import qualified Data.HashSet as Set
import Numeric
import System.Directory
import System.Environment
import System.IO
import System.IO.Error
import System.IO.Unsafe
import GHC.IO.Handle(hDuplicate,hDuplicateTo)
import Development.Shake.Classes
---------------------------------------------------------------------
-- LOCK
-- | Like an MVar, but has no value
newtype Lock = Lock (MVar ())
instance Show Lock where show _ = "Lock"
newLock :: IO Lock
newLock = fmap Lock $ newMVar ()
withLock :: Lock -> IO a -> IO a
withLock (Lock x) = withMVar x . const
withLockTry :: Lock -> IO a -> IO (Maybe a)
withLockTry (Lock m) act =
mask $ \restore -> do
a <- tryTakeMVar m
case a of
Nothing -> return Nothing
Just _ -> restore (fmap Just act) `finally` putMVar m ()
---------------------------------------------------------------------
-- VAR
-- | Like an MVar, but must always be full
newtype Var a = Var (MVar a)
instance Show (Var a) where show _ = "Var"
newVar :: a -> IO (Var a)
newVar = fmap Var . newMVar
readVar :: Var a -> IO a
readVar (Var x) = readMVar x
modifyVar :: Var a -> (a -> IO (a, b)) -> IO b
modifyVar (Var x) f = modifyMVar x f
modifyVar_ :: Var a -> (a -> IO a) -> IO ()
modifyVar_ (Var x) f = modifyMVar_ x f
withVar :: Var a -> (a -> IO b) -> IO b
withVar (Var x) f = withMVar x f
---------------------------------------------------------------------
-- BARRIER
-- | Starts out empty, then is filled exactly once
newtype Barrier a = Barrier (MVar a)
instance Show (Barrier a) where show _ = "Barrier"
newBarrier :: IO (Barrier a)
newBarrier = fmap Barrier newEmptyMVar
signalBarrier :: Barrier a -> a -> IO ()
signalBarrier (Barrier x) = putMVar x
waitBarrier :: Barrier a -> IO a
waitBarrier (Barrier x) = readMVar x
waitBarrierMaybe :: Barrier a -> IO (Maybe a)
waitBarrierMaybe (Barrier x) = do
res <- tryTakeMVar x
whenJust res $ putMVar x
return res
---------------------------------------------------------------------
-- Data.Time
type Time = Float -- how far you are through this run, in seconds
-- | Call once at the start, then call repeatedly to get Time values out
offsetTime :: IO (IO Time)
offsetTime = do
start <- getCurrentTime
return $ do
end <- getCurrentTime
return $ fromRational $ toRational $ end `diffUTCTime` start
type Duration = Float -- duration in seconds
duration :: IO a -> IO (Duration, a)
duration act = do
time <- offsetTime
res <- act
time <- time
return (time, res)
sleep :: Duration -> IO ()
sleep x = threadDelay $ ceiling $ x * 1000000
---------------------------------------------------------------------
-- Data.IORef
-- Two 's because GHC 7.6 has a strict modifyIORef
modifyIORef'' :: IORef a -> (a -> a) -> IO ()
modifyIORef'' ref f = do
x <- readIORef ref
writeIORef'' ref $ f x
writeIORef'' :: IORef a -> a -> IO ()
writeIORef'' ref !x = writeIORef ref x
---------------------------------------------------------------------
-- Data.List
-- | Like 'nub', but the results may be in any order.
fastNub :: (Eq a, Hashable a) => [a] -> [a]
fastNub = f Set.empty
where f seen [] = []
f seen (x:xs) | x `Set.member` seen = f seen xs
| otherwise = x : f (Set.insert x seen) xs
showQuote :: String -> String
showQuote xs | any isSpace xs = "\"" ++ concatMap (\x -> if x == '\"' then "\"\"" else [x]) xs ++ "\""
| otherwise = xs
word1 :: String -> (String, String)
word1 x = second (dropWhile isSpace) $ break isSpace $ dropWhile isSpace x
---------------------------------------------------------------------
-- Data.String
showDP :: Int -> Double -> String
showDP n x = a ++ "." ++ b ++ replicate (n - length b) '0'
where (a,b) = second (drop 1) $ break (== '.') $ showFFloat (Just n) x ""
showTime :: Double -> String
showTime x | x >= 3600 = f (x / 60) "h" "m"
| x >= 60 = f x "m" "s"
| otherwise = showDP 2 x ++ "s"
where
f x m s = show ms ++ m ++ ['0' | ss < 10] ++ show ss ++ m
where (ms,ss) = round x `divMod` 60
---------------------------------------------------------------------
-- Control.Monad
whenJust :: Monad m => Maybe a -> (a -> m ()) -> m ()
whenJust (Just a) f = f a
whenJust Nothing f = return ()
loopM :: Monad m => (a -> m (Either a b)) -> a -> m b
loopM act x = do
res <- act x
case res of
Left x -> loopM act x
Right v -> return v
whileM :: Monad m => m Bool -> m ()
whileM act = do
b <- act
when b $ whileM act
concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]
concatMapM f xs = liftM concat $ mapM f xs
partitionM :: Monad m => (a -> m Bool) -> [a] -> m ([a], [a])
partitionM f [] = return ([], [])
partitionM f (x:xs) = do
t <- f x
(a,b) <- partitionM f xs
return $ if t then (x:a,b) else (a,x:b)
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]
mapMaybeM f xs = liftM catMaybes $ mapM f xs
liftA2' :: Applicative m => m a -> m b -> (a -> b -> c) -> m c
liftA2' a b f = liftA2 f a b
---------------------------------------------------------------------
-- System.Info
isWindows :: Bool
#if defined(mingw32_HOST_OS)
isWindows = True
#else
isWindows = False
#endif
-- Could be written better in C, but sticking to Haskell for laziness
getProcessorCount :: IO Int
-- unsafePefromIO so we cache the result and only compute it once
getProcessorCount = let res = unsafePerformIO act in return res
where
act = handle (\(_ :: SomeException) -> return 1) $ do
env <- getEnvMaybe "NUMBER_OF_PROCESSORS"
case env of
Just s | [(i,"")] <- reads s -> return i
_ -> do
src <- readFile "/proc/cpuinfo"
return $ length [() | x <- lines src, "processor" `isPrefixOf` x]
---------------------------------------------------------------------
-- System.IO
readFileUCS2 :: FilePath -> IO String
readFileUCS2 name = openFile name ReadMode >>= \h -> do
hSetEncoding h utf16
hGetContents h
getEnvMaybe :: String -> IO (Maybe String)
getEnvMaybe x = catchJust (\x -> if isDoesNotExistError x then Just x else Nothing) (fmap Just $ getEnv x) (const $ return Nothing)
captureOutput :: IO () -> IO String
captureOutput act = do
tmp <- getTemporaryDirectory
(f,h) <- openTempFile tmp "hlint"
sto <- hDuplicate stdout
ste <- hDuplicate stderr
hDuplicateTo h stdout
hDuplicateTo h stderr
hClose h
act
hDuplicateTo sto stdout
hDuplicateTo ste stderr
res <- readFile f
evaluate $ length res
removeFile f
return res
withCapabilities :: Int -> IO a -> IO a
#if __GLASGOW_HASKELL__ >= 706
withCapabilities new act | rtsSupportsBoundThreads = do
old <- getNumCapabilities
if old == new then act else
bracket_ (setNumCapabilities new) (setNumCapabilities old) act
#endif
withCapabilities new act = act
withBufferMode :: Handle -> BufferMode -> IO a -> IO a
withBufferMode h b act = bracket (hGetBuffering h) (hSetBuffering h) $ const $ do
hSetBuffering h LineBuffering
act
|