-
Notifications
You must be signed in to change notification settings - Fork 194
/
optimize-201408.hs
312 lines (281 loc) · 11.1 KB
/
optimize-201408.hs
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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE ExistentialQuantification #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE MultiParamTypeClasses #-}
-- Collection of three benchmarks: a simple integral sum, monte carlo analysis,
-- and sliding vector.
import Control.DeepSeq
import Control.Monad (foldM)
import Control.Monad (when)
import Control.Monad.IO.Class (MonadIO, liftIO)
import Criterion.Main
import Data.Conduit
import qualified Data.Conduit.List as CL
import qualified Data.Foldable as F
import Data.Functor.Identity (runIdentity)
import Data.IORef
import Data.List (foldl')
import Data.Monoid (mempty)
import qualified Data.Sequence as Seq
import qualified Data.Vector as VB
import qualified Data.Vector.Generic as V
import qualified Data.Vector.Generic.Mutable as VM
import qualified Data.Vector.Unboxed as VU
import System.Environment (withArgs)
import qualified System.Random.MWC as MWC
import Test.Hspec
data TestBench = TBGroup String [TestBench]
| TBBench Benchmark
| forall a b. (Eq b, Show b) => TBPure String a b (a -> b)
| forall a. (Eq a, Show a) => TBIO String a (IO a)
| forall a. (Eq a, Show a) => TBIOTest String (a -> IO ()) (IO a)
| forall a. (Eq a, Show a) => TBIOBench String a (IO a) (IO ())
toSpec :: TestBench -> Spec
toSpec (TBGroup name tbs) = describe name $ mapM_ toSpec tbs
toSpec (TBBench _) = return ()
toSpec (TBPure name a b f) = it name $ f a `shouldBe` b
toSpec (TBIO name a f) = it name $ f >>= (`shouldBe` a)
toSpec (TBIOTest name spec f) = it name $ f >>= spec
toSpec (TBIOBench name a f _) = it name $ f >>= (`shouldBe` a)
toBench :: TestBench -> Benchmark
toBench (TBGroup name tbs) = bgroup name $ map toBench tbs
toBench (TBBench b) = b
toBench (TBPure name a _ f) = bench name $ whnf f a
toBench (TBIO name _ f) = bench name $ whnfIO f
toBench (TBIOTest name _ f) = bench name $ whnfIO f
toBench (TBIOBench name _ _ f) = bench name $ whnfIO f
runTestBench :: [TestBench] -> IO ()
runTestBench tbs = do
withArgs [] $ hspec $ mapM_ toSpec tbs
defaultMain $ map toBench tbs
main :: IO ()
main = runTestBench =<< sequence
[ sumTB
, monteCarloTB
, fmap (TBGroup "sliding window") $ sequence
[ slidingWindow 10
, slidingWindow 30
, slidingWindow 100
, slidingWindow 1000
]
]
-----------------------------------------------------------------------
sumTB :: IO TestBench
sumTB = do
upperRef <- newIORef upper0
return $ TBGroup "sum"
[ TBPure "Data.List.foldl'" upper0 expected
$ \upper -> foldl' (+) 0 [1..upper]
, TBIO "Control.Monad.foldM" expected $ do
upper <- readIORef upperRef
foldM plusM 0 [1..upper]
, TBPure "low level" upper0 expected $ \upper ->
let go x !t
| x > upper = t
| otherwise = go (x + 1) (t + x)
in go 1 0
, TBPure "boxed vectors" upper0 expected
$ \upper -> VB.foldl' (+) 0 (VB.enumFromTo 1 upper)
, TBPure "unboxed vectors" upper0 expected
$ \upper -> VU.foldl' (+) 0 (VU.enumFromTo 1 upper)
, TBPure "conduit, pure, fold" upper0 expected
$ \upper -> runIdentity $ CL.enumFromTo 1 upper $$ CL.fold (+) 0
, TBPure "conduit, pure, foldM" upper0 expected
$ \upper -> runIdentity $ CL.enumFromTo 1 upper $$ CL.foldM plusM 0
, TBIO "conduit, IO, fold" expected $ do
upper <- readIORef upperRef
CL.enumFromTo 1 upper $$ CL.fold (+) 0
, TBIO "conduit, IO, foldM" expected $ do
upper <- readIORef upperRef
CL.enumFromTo 1 upper $$ CL.foldM plusM 0
]
where
upper0 = 10000 :: Int
expected = sum [1..upper0]
plusM x y = return $! x + y
-----------------------------------------------------------------------
monteCarloTB :: IO TestBench
monteCarloTB = return $ TBGroup "monte carlo"
[ TBIOTest "low level" closeEnough $ do
gen <- MWC.createSystemRandom
let go 0 !t = return $! fromIntegral t / fromIntegral count * 4
go i !t = do
(x, y) <- MWC.uniform gen
let t'
| x*x + y*(y :: Double) < 1 = t + 1
| otherwise = t
go (i - 1) t'
go count (0 :: Int)
, TBIOTest "conduit" closeEnough $ do
successes <- sourceRandomN count
$$ CL.fold (\t (x, y) ->
if (x*x + y*(y :: Double) < 1)
then t + 1
else t)
(0 :: Int)
return $ fromIntegral successes / fromIntegral count * 4
]
where
count = 100000 :: Int
closeEnough x
| abs (x - 3.14159 :: Double) < 0.2 = return ()
| otherwise = error $ "Monte carlo analysis too inaccurate: " ++ show x
sourceRandomN :: (MWC.Variate a, MonadIO m) => Int -> Source m a
sourceRandomN cnt0 = do
gen <- liftIO MWC.createSystemRandom
let loop 0 = return ()
loop cnt = do
x <- liftIO $ MWC.uniform gen
yield x
loop (cnt - 1)
loop cnt0
-----------------------------------------------------------------------
slidingWindow :: Int -> IO TestBench
slidingWindow window = do
upperRef <- newIORef upper0
return $ TBGroup (show window)
[ TBIOBench "low level, Seq" expected
(swLowLevelSeq window upperRef id (\x y -> x . (F.toList y:)) ($ []))
(swLowLevelSeq window upperRef () (\() y -> rnf y) id)
{- https://ghc.haskell.org/trac/ghc/ticket/9446
, TBIOBench "low level, boxed Vector" expected
(swLowLevelVector window upperRef id (\x y -> x . (VB.toList y:)) ($ []))
(swLowLevelVector window upperRef () (\() y -> rnf (y :: VB.Vector Int)) id)
-}
, TBBench $ bench "low level, boxed Vector" $ whnfIO $
swLowLevelVector window upperRef () (\() y -> rnf (y :: VB.Vector Int)) id
, TBIOBench "low level, unboxed Vector" expected
(swLowLevelVector window upperRef id (\x y -> x . (VU.toList y:)) ($ []))
(swLowLevelVector window upperRef () (\() y -> rnf (y :: VU.Vector Int)) id)
, TBIOBench "conduit, Seq" expected
(swConduitSeq window upperRef id (\x y -> x . (F.toList y:)) ($ []))
(swConduitSeq window upperRef () (\() y -> rnf y) id)
{- https://ghc.haskell.org/trac/ghc/ticket/9446
, TBIOBench "conduit, boxed Vector" expected
(swConduitVector window upperRef id (\x y -> x . (VB.toList y:)) ($ []))
(swConduitVector window upperRef () (\() y -> rnf (y :: VB.Vector Int)) id)
-}
, TBBench $ bench "conduit, boxed Vector" $ whnfIO $
swConduitVector window upperRef () (\() y -> rnf (y :: VB.Vector Int)) id
, TBIOBench "conduit, unboxed Vector" expected
(swConduitVector window upperRef id (\x y -> x . (VU.toList y:)) ($ []))
(swConduitVector window upperRef () (\() y -> rnf (y :: VU.Vector Int)) id)
]
where
upper0 = 10000
expected =
loop [1..upper0]
where
loop input
| length x == window = x : loop y
| otherwise = []
where
x = take window input
y = drop 1 input
swLowLevelSeq :: Int -> IORef Int -> t -> (t -> Seq.Seq Int -> t) -> (t -> t') -> IO t'
swLowLevelSeq window upperRef t0 f final = do
upper <- readIORef upperRef
let phase1 i !s
| i > window = phase2 i s t0
| otherwise = phase1 (i + 1) (s Seq.|> i)
phase2 i !s !t
| i > upper = t'
| otherwise = phase2 (i + 1) s' t'
where
t' = f t s
s' = Seq.drop 1 s Seq.|> i
return $! final $! phase1 1 mempty
swLowLevelVector :: V.Vector v Int
=> Int
-> IORef Int
-> t
-> (t -> v Int -> t)
-> (t -> t')
-> IO t'
swLowLevelVector window upperRef t0 f final = do
upper <- readIORef upperRef
let go !i !t _ _ _ | i > upper = return $! final $! t
go !i !t !end _mv mv2 | end == bufSz = newBuf >>= go i t sz mv2
go !i !t !end mv mv2 = do
VM.unsafeWrite mv end i
when (end > sz) $ VM.unsafeWrite mv2 (end - sz) i
let end' = end + 1
t' <-
if end' < sz
then return t
else do
v <- V.unsafeFreeze $ VM.unsafeSlice (end' - sz) sz mv
return $! f t v
go (i + 1) t' end' mv mv2
mv <- newBuf
mv2 <- newBuf
go 1 t0 0 mv mv2
where
sz = window
bufSz = 2 * window
newBuf = VM.new bufSz
swConduitSeq :: Int
-> IORef Int
-> t
-> (t -> Seq.Seq Int -> t)
-> (t -> t')
-> IO t'
swConduitSeq window upperRef t0 f final = do
upper <- readIORef upperRef
t <- CL.enumFromTo 1 upper
$$ slidingWindowC window
=$ CL.fold f t0
return $! final t
swConduitVector :: V.Vector v Int
=> Int
-> IORef Int
-> t
-> (t -> v Int -> t)
-> (t -> t')
-> IO t'
swConduitVector window upperRef t0 f final = do
upper <- readIORef upperRef
t <- CL.enumFromTo 1 upper
$$ slidingVectorC window
=$ CL.fold f t0
return $! final t
slidingWindowC :: Monad m => Int -> Conduit a m (Seq.Seq a)
slidingWindowC sz =
go sz mempty
where
goContinue st = await >>=
maybe (return ())
(\x -> do
let st' = st Seq.|> x
yield st' >> goContinue (Seq.drop 1 st')
)
go 0 st = yield st >> goContinue (Seq.drop 1 st)
go !n st = CL.head >>= \m ->
case m of
Nothing | n < sz -> yield st
| otherwise -> return ()
Just x -> go (n-1) (st Seq.|> x)
slidingVectorC :: V.Vector v a => Int -> Conduit a IO (v a)
slidingVectorC sz = do
mv <- newBuf
mv2 <- newBuf
go 0 mv mv2
where
bufSz = 2 * sz
newBuf = liftIO (VM.new bufSz)
go !end _mv mv2 | end == bufSz = newBuf >>= go sz mv2
go !end mv mv2 = do
mx <- await
case mx of
Nothing -> when (end > 0 && end < sz) $ do
v <- liftIO $ V.unsafeFreeze $ VM.take end mv
yield v
Just x -> do
liftIO $ do
VM.unsafeWrite mv end x
when (end > sz) $ VM.unsafeWrite mv2 (end - sz) x
let end' = end + 1
when (end' >= sz) $ do
v <- liftIO $ V.unsafeFreeze $ VM.unsafeSlice (end' - sz) sz mv
yield v
go end' mv mv2