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
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
|
-----------------------------------------------------------------------------
--
-- (c) Simon Marlow 1997-2005
--
-----------------------------------------------------------------------------
module Slurp (Status(..), Results(..), ResultTable, parse_log) where
import Control.Monad
import qualified Data.Map as Map
import Data.Map (Map)
import Text.Regex
import Data.Maybe
-- import Debug.Trace
-----------------------------------------------------------------------------
-- This is the structure into which we collect our results:
type ResultTable = Map String Results
data Status
= NotDone
| Success
| OutOfHeap
| OutOfStack
| Exit Int
| WrongStdout
| WrongStderr
data Results = Results {
compile_time :: Map String Float,
module_size :: Map String Int,
binary_size :: Maybe Int,
link_time :: Maybe Float,
run_time :: [Float],
mut_time :: [Float],
instrs :: Maybe Integer,
mem_reads :: Maybe Integer,
mem_writes :: Maybe Integer,
cache_misses :: Maybe Integer,
gc_work :: Maybe Integer,
gc_time :: [Float],
allocs :: Maybe Integer,
run_status :: Status,
compile_status :: Status
}
emptyResults :: Results
emptyResults = Results {
compile_time = Map.empty,
module_size = Map.empty,
binary_size = Nothing,
link_time = Nothing,
run_time = [],
mut_time = [],
instrs = Nothing,
mem_reads = Nothing,
mem_writes = Nothing,
cache_misses = Nothing,
gc_time = [],
gc_work = Nothing,
allocs = Nothing,
compile_status = NotDone,
run_status = NotDone
}
-----------------------------------------------------------------------------
-- Parse the log file
{-
Various banner lines:
==nofib== awards: size of QSort.o follows...
==nofib== banner: size of banner follows...
==nofib== awards: time to link awards follows...
==nofib== awards: time to run awards follows...
==nofib== boyer2: time to compile Checker follows...
-}
-- NB. the hyphen must come last (or first) inside [...] to stand for itself.
banner_re :: Regex
banner_re = mkRegex "^==nofib==[ \t]+([A-Za-z0-9_-]+):[ \t]+(size of|time to link|time to run|time to compile)[ \t]+([A-Za-z0-9_-]+)(\\.o)?[ \t]+follows"
{-
This regexp for the output of "time" works on FreeBSD, other versions
of "time" will need different regexps.
-}
time_re :: String -> Maybe (Float, Float, Float)
time_re s = case matchRegex re s of
Just [real, user, system] ->
Just (read real, read user, read system)
Just _ -> error "time_re: Can't happen"
Nothing -> Nothing
where re = mkRegex "^[ \t]*([0-9.]+)[ \t]+real[ \t]+([0-9.]+)[ \t]+user[ \t]+([0-9.]+)[ \t]+sys[ \t]*$"
time_gnu17_re :: String -> Maybe (Float, Float, String)
time_gnu17_re s = case matchRegex re s of
Just [user, system, elapsed] ->
Just (read user, read system, elapsed)
Just _ -> error "time_gnu17_re: Can't happen"
Nothing -> Nothing
where re = mkRegex "^[ \t]*([0-9.]+)user[ \t]+([0-9.]+)system[ \t]+([0-9.:]+)elapsed"
-- /usr/bin/time --version reports: GNU time 1.7
-- notice the order is different, and the elapsed time
-- is [hh:]mm:ss.s
size_re :: String -> Maybe (Int, Int, Int)
size_re s = case matchRegex re s of
Just [text, datas, bss] ->
Just (read text, read datas, read bss)
Just _ -> error "size_re: Can't happen"
Nothing -> Nothing
where re = mkRegex "^[ \t]*([0-9]+)[ \t]+([0-9]+)[ \t]+([0-9]+)"
{-
<<ghc: 5820820 bytes, 0 GCs, 0/0 avg/max bytes residency (0 samples), 41087234 bytes GC work, 0.00 INIT (0.05 elapsed), 0.08 MUT (0.18 elapsed), 0.00 GC (0.00 elapsed) :ghc>>
= (bytes, gcs, avg_resid, max_resid, samples, gc_work,
init, init_elapsed, mut, mut_elapsed, gc, gc_elapsed)
ghc1_re = pre GHC 4.02
ghc2_re = GHC 4.02 (includes "xxM in use")
ghc3_re = GHC 4.03 (includes "xxxx bytes GC work")
-}
ghc1_re :: String -> Maybe (Integer, Integer, Integer, Integer, Integer, Integer, Float, Float, Float, Float, Float, Float)
ghc1_re s = case matchRegex re s of
Just [allocations, gcs, avg_residency, max_residency, samples, gc_work', initialisation, initialisation_elapsed, mut, mut_elapsed, gc, gc_elapsed] ->
Just (read allocations, read gcs, read avg_residency, read max_residency, read samples, read gc_work', read initialisation, read initialisation_elapsed, read mut, read mut_elapsed, read gc, read gc_elapsed)
Just _ -> error "ghc1_re: Can't happen"
Nothing -> Nothing
where re = mkRegex "^<<ghc:[ \t]+([0-9]+)[ \t]+bytes,[ \t]*([0-9]+)[ \t]+GCs,[ \t]*([0-9]+)/([0-9]+)[ \t]+avg/max bytes residency \\(([0-9]+) samples\\), ([0-9]+) bytes GC work, ([0-9.]+) INIT \\(([0-9.]+) elapsed\\), ([0-9.]+) MUT \\(([0-9.]+) elapsed\\), ([0-9.]+) GC \\(([0-9.]+) elapsed\\) :ghc>>"
ghc2_re :: String -> Maybe (Integer, Integer, Integer, Integer, Integer, Integer, Float, Float, Float, Float, Float, Float)
ghc2_re s = case matchRegex re s of
Just [allocations, gcs, avg_residency, max_residency, samples, in_use, initialisation, initialisation_elapsed, mut, mut_elapsed, gc, gc_elapsed] ->
Just (read allocations, read gcs, read avg_residency, read max_residency, read samples, read in_use, read initialisation, read initialisation_elapsed, read mut, read mut_elapsed, read gc, read gc_elapsed)
Just _ -> error "ghc2_re: Can't happen"
Nothing -> Nothing
where re = mkRegex "^<<ghc:[ \t]+([0-9]+)[ \t]+bytes,[ \t]*([0-9]+)[ \t]+GCs,[ \t]*([0-9]+)/([0-9]+)[ \t]+avg/max bytes residency \\(([0-9]+) samples\\), ([0-9]+)M in use, ([0-9.]+) INIT \\(([0-9.]+) elapsed\\), ([0-9.]+) MUT \\(([0-9.]+) elapsed\\), ([0-9.]+) GC \\(([0-9.]+) elapsed\\) :ghc>>"
ghc3_re :: String -> Maybe (Integer, Integer, Integer, Integer, Integer, Integer, Integer, Float, Float, Float, Float, Float, Float)
ghc3_re s = case matchRegex re s of
Just [allocations, gcs, avg_residency, max_residency, samples, gc_work', in_use, initialisation, initialisation_elapsed, mut, mut_elapsed, gc, gc_elapsed] ->
Just (read allocations, read gcs, read avg_residency, read max_residency, read samples, read gc_work', read in_use, read initialisation, read initialisation_elapsed, read mut, read mut_elapsed, read gc, read gc_elapsed)
Just _ -> error "ghc3_re: Can't happen"
Nothing -> Nothing
where re = mkRegex "^<<ghc:[ \t]+([0-9]+)[ \t]+bytes,[ \t]*([0-9]+)[ \t]+GCs,[ \t]*([0-9]+)/([0-9]+)[ \t]+avg/max bytes residency \\(([0-9]+) samples\\), ([0-9]+) bytes GC work, ([0-9]+)M in use, ([0-9.]+) INIT \\(([0-9.]+) elapsed\\), ([0-9.]+) MUT \\(([0-9.]+) elapsed\\), ([0-9.]+) GC \\(([0-9.]+) elapsed\\) :ghc>>"
ghc4_re :: String -> Maybe (Integer, Integer, Integer, Integer, Integer, Integer, Integer, Float, Float, Float, Float, Float, Float, Integer, Integer, Integer, Integer)
ghc4_re s = case matchRegex re s of
Just [allocations, gcs, avg_residency, max_residency, samples, gc_work', in_use, initialisation, initialisation_elapsed, mut, mut_elapsed, gc, gc_elapsed, instructions, memory_reads, memory_writes, l2_cache_misses] ->
Just (read allocations, read gcs, read avg_residency, read max_residency, read samples, read gc_work', read in_use, read initialisation, read initialisation_elapsed, read mut, read mut_elapsed, read gc, read gc_elapsed, read instructions, read memory_reads, read memory_writes, read l2_cache_misses)
Just _ -> error "ghc4_re: Can't happen"
Nothing -> Nothing
where re = mkRegex "^<<ghc-instrs:[ \t]+([0-9]+)[ \t]+bytes,[ \t]*([0-9]+)[ \t]+GCs,[ \t]*([0-9]+)/([0-9]+)[ \t]+avg/max bytes residency \\(([0-9]+) samples\\), ([0-9]+) bytes GC work, ([0-9]+)M in use, ([0-9.]+) INIT \\(([0-9.]+) elapsed\\), ([0-9.]+) MUT \\(([0-9.]+) elapsed\\), ([0-9.]+) GC \\(([0-9.]+) elapsed\\), ([0-9]+) instructions, ([0-9]+) memory reads, ([0-9]+) memory writes, ([0-9]+) L2 cache misses :ghc-instrs>>"
wrong_exit_status, wrong_output, out_of_heap, out_of_stack :: Regex
wrong_exit_status = mkRegex "^\\**[ \t]*expected exit status ([0-9]+) not seen ; got ([0-9]+)"
wrong_output = mkRegex "^expected (stdout|stderr) not matched by reality$"
out_of_heap = mkRegex "^\\+ Heap exhausted;$"
out_of_stack = mkRegex "^\\+ Stack space overflow:"
parse_log :: String -> ResultTable
parse_log
= combine_results -- collate information
. concat
. map process_chunk -- get information from each chunk
. tail -- first chunk is junk
. chunk_log [] [] -- break at banner lines
. lines
combine_results :: [(String,Results)] -> Map String Results
combine_results = foldr f Map.empty
where
f (prog,results) fm = Map.insertWith (flip combine2Results) prog results fm
combine2Results :: Results -> Results -> Results
combine2Results
Results{ compile_time = ct1, link_time = lt1,
module_size = ms1,
run_time = rt1, mut_time = mt1,
instrs = is1, mem_reads = mr1, mem_writes = mw1,
cache_misses = cm1,
gc_time = gt1, gc_work = gw1,
binary_size = bs1, allocs = al1,
run_status = rs1, compile_status = cs1 }
Results{ compile_time = ct2, link_time = lt2,
module_size = ms2,
run_time = rt2, mut_time = mt2,
instrs = is2, mem_reads = mr2, mem_writes = mw2,
cache_misses = cm2,
gc_time = gt2, gc_work = gw2,
binary_size = bs2, allocs = al2,
run_status = rs2, compile_status = cs2 }
= Results{ compile_time = Map.unionWith (flip const) ct1 ct2,
module_size = Map.unionWith (flip const) ms1 ms2,
link_time = lt1 `mplus` lt2,
run_time = rt1 ++ rt2,
mut_time = mt1 ++ mt2,
instrs = is1 `mplus` is2,
mem_reads = mr1 `mplus` mr2,
mem_writes = mw1 `mplus` mw2,
cache_misses = cm1 `mplus` cm2,
gc_time = gt1 ++ gt2,
gc_work = gw1 `mplus` gw2,
binary_size = bs1 `mplus` bs2,
allocs = al1 `mplus` al2,
run_status = combStatus rs1 rs2,
compile_status = combStatus cs1 cs2 }
combStatus :: Status -> Status -> Status
combStatus NotDone y = y
combStatus x NotDone = x
combStatus x _ = x
chunk_log :: [String] -> [String] -> [String] -> [([String],[String])]
chunk_log header chunk [] = [(header,chunk)]
chunk_log header chunk (l:ls) =
case matchRegex banner_re l of
Nothing -> chunk_log header (l:chunk) ls
Just stuff -> (header,chunk) : chunk_log stuff [] ls
process_chunk :: ([String],[String]) -> [(String,Results)]
process_chunk (progName : what : modName : _, chk) =
case what of
"time to compile" -> parse_compile_time progName modName chk
"time to run" -> parse_run_time progName (reverse chk) emptyResults NotDone
"time to link" -> parse_link_time progName chk
"size of" -> parse_size progName modName chk
_ -> error ("process_chunk: "++what)
process_chunk _ = error "process_chunk: Can't happen"
parse_compile_time :: String -> String -> [String] -> [(String, Results)]
parse_compile_time _ _ [] = []
parse_compile_time progName modName (l:ls) =
case time_re l of {
Just (_real, user, _system) ->
let ct = Map.singleton modName user
in
[(progName, emptyResults{compile_time = ct})];
Nothing ->
case time_gnu17_re l of {
Just (user, _system, _elapsed) ->
let ct = Map.singleton modName user
in
[(progName, emptyResults{compile_time = ct})];
Nothing ->
case ghc1_re l of {
Just (_, _, _, _, _, _, initialisation, _, mut, _, gc, _) ->
let
time = (initialisation + mut + gc) :: Float
ct = Map.singleton modName time
in
[(progName, emptyResults{compile_time = ct})];
Nothing ->
case ghc2_re l of {
Just (_, _, _, _, _, _, initialisation, _, mut, _, gc, _) ->
let ct = Map.singleton modName (initialisation + mut + gc)
in
[(progName, emptyResults{compile_time = ct})];
Nothing ->
case ghc3_re l of {
Just (_, _, _, _, _, _, _, initialisation, _, mut, _, gc, _) ->
let ct = Map.singleton modName (initialisation + mut + gc)
in
[(progName, emptyResults{compile_time = ct})];
Nothing ->
case ghc4_re l of {
Just (_, _, _, _, _, _, _, initialisation, _, mut, _, gc, _, _, _, _, _) ->
let ct = Map.singleton modName (initialisation + mut + gc)
in
[(progName, emptyResults{compile_time = ct})];
Nothing ->
parse_compile_time progName modName ls
}}}}}}
parse_link_time :: String -> [String] -> [(String, Results)]
parse_link_time _ [] = []
parse_link_time prog (l:ls) =
case time_re l of {
Just (_real, user, _system) ->
[(prog,emptyResults{link_time = Just user})];
Nothing ->
case time_gnu17_re l of {
Just (user, _system, _elapsed) ->
[(prog,emptyResults{link_time = Just user})];
Nothing ->
parse_link_time prog ls
}}
-- There might be multiple runs of the program, so we have to collect up
-- all the results. Variable results like runtimes are aggregated into
-- a list, whereas the non-variable aspects are just kept singly.
parse_run_time :: String -> [String] -> Results -> Status
-> [(String, Results)]
parse_run_time _ [] _ NotDone = []
parse_run_time prog [] res ex = [(prog, res{run_status=ex})]
parse_run_time prog (l:ls) res ex =
case ghc1_re l of {
Just (allocations, _, _, _, _, _, initialisation, _, mut, _, gc, _) ->
got_run_result allocations initialisation mut gc Nothing
Nothing Nothing Nothing Nothing;
Nothing ->
case ghc2_re l of {
Just (allocations, _, _, _, _, _, initialisation, _, mut, _, gc, _) ->
got_run_result allocations initialisation mut gc Nothing
Nothing Nothing Nothing Nothing;
Nothing ->
case ghc3_re l of {
Just (allocations, _, _, _, _, gc_work', _, initialisation, _, mut, _, gc, _) ->
got_run_result allocations initialisation mut gc
(Just gc_work') Nothing Nothing Nothing Nothing;
Nothing ->
case ghc4_re l of {
Just (allocations, _, _, _, _, gc_work', _, initialisation, _, mut, _, gc, _, is, mem_rs, mem_ws, cache_misses') ->
got_run_result allocations initialisation mut gc
(Just gc_work') (Just is) (Just mem_rs)
(Just mem_ws) (Just cache_misses');
Nothing ->
case matchRegex wrong_output l of {
Just ["stdout"] ->
parse_run_time prog ls res (combineRunResult WrongStdout ex);
Just ["stderr"] ->
parse_run_time prog ls res (combineRunResult WrongStderr ex);
Just _ -> error "wrong_output: Can't happen";
Nothing ->
case matchRegex wrong_exit_status l of {
Just [_wanted, got] ->
parse_run_time prog ls res (combineRunResult (Exit (read got)) ex);
Just _ -> error "wrong_exit_status: Can't happen";
Nothing ->
case matchRegex out_of_heap l of {
Just _ ->
parse_run_time prog ls res (combineRunResult OutOfHeap ex);
Nothing ->
case matchRegex out_of_stack l of {
Just _ ->
parse_run_time prog ls res (combineRunResult OutOfStack ex);
Nothing ->
parse_run_time prog ls res ex;
}}}}}}}}
where
got_run_result allocations initialisation mut gc gc_work' instrs' mem_rs mem_ws cache_misses'
= -- trace ("got_run_result: " ++ initialisation ++ ", " ++ mut ++ ", " ++ gc) $
let
time = initialisation + mut + gc
res' = combine2Results res
emptyResults{ run_time = [time],
mut_time = [mut],
gc_time = [gc],
gc_work = gc_work',
allocs = Just allocations,
instrs = instrs',
mem_reads = mem_rs,
mem_writes = mem_ws,
cache_misses = cache_misses',
run_status = Success
}
in
parse_run_time prog ls res' Success
combineRunResult :: Status -> Status -> Status
combineRunResult OutOfHeap _ = OutOfHeap
combineRunResult _ OutOfHeap = OutOfHeap
combineRunResult OutOfStack _ = OutOfStack
combineRunResult _ OutOfStack = OutOfStack
combineRunResult (Exit e) _ = Exit e
combineRunResult _ (Exit e) = Exit e
combineRunResult exit _ = exit
parse_size :: String -> String -> [String] -> [(String, Results)]
parse_size _ _ [] = []
parse_size progName modName (l:ls) =
case size_re l of
Nothing -> parse_size progName modName ls
Just (text, datas, _bss)
| progName == modName ->
[(progName,emptyResults{binary_size =
Just (text + datas),
compile_status = Success})]
| otherwise ->
let ms = Map.singleton modName (text + datas)
in
[(progName,emptyResults{module_size = ms})]
|