-
-
Notifications
You must be signed in to change notification settings - Fork 38
/
SimpleDeadVariableEliminationSpec.hs
303 lines (283 loc) · 9.09 KB
/
SimpleDeadVariableEliminationSpec.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
{-# LANGUAGE OverloadedStrings, QuasiQuotes, ViewPatterns #-}
module Transformations.Optimising.SimpleDeadVariableEliminationSpec where
import Transformations.Optimising.SimpleDeadVariableElimination
import Transformations.EffectMap
import Grin.TypeCheck
import Test.Hspec
import Grin.TH
import Grin.PrimOpsPrelude
import Test.Test hiding (newVar)
import Test.Assertions
runTests :: IO ()
runTests = hspec spec
spec :: Spec
spec = do
describe "bugs" $ do
it "keep blocks" $ do
let before = [prog|
grinMain =
fun_main.0 <- pure (P1Main.main.closure.0)
p.1.0 <- pure fun_main.0
"unboxed.C\"GHC.Prim.Unit#\".0" <- do
result_Main.main1.0.0.0 <- pure (P1Main.main1.closure.0)
apply.unboxed2 $ result_Main.main1.0.0.0
_prim_int_print $ 0
apply.unboxed2 p.1.X =
do
(P1Main.main1.closure.0) <- pure p.1.X
_prim_int_print $ 12
store (F"GHC.Tuple.()")
|]
let after = [prog|
grinMain =
"unboxed.C\"GHC.Prim.Unit#\".0" <- do
result_Main.main1.0.0.0 <- pure (P1Main.main1.closure.0)
apply.unboxed2 $ result_Main.main1.0.0.0
_prim_int_print $ 0
apply.unboxed2 p.1.X =
do
_prim_int_print $ 12
store (F"GHC.Tuple.()")
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
it "do not remove effectful case" $ do
let before = withPrimPrelude [prog|
sideeff s1 =
s2 <- _prim_int_add s1 1
_prim_int_print s2
grinMain =
y <- pure (CInt 0)
x <- case y of
(CInt x1) -> sideeff x1
pure 1 -- pure (CInt 1)
(CFloat y1) -> y2 <- _prim_int_add 1 2
pure 2 -- pure (CInt y2)
pure ()
|]
let after = withPrimPrelude [prog|
sideeff s1 =
s2 <- _prim_int_add s1 1
_prim_int_print s2
grinMain =
y <- pure (CInt 0)
x <- case y of
(CInt x1) -> sideeff x1
pure 1
(CFloat y1) -> pure 2
pure ()
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
it "do not remove effectful case 2" $ do
let before = withPrimPrelude [prog|
grinMain =
y <- pure (CInt #"str")
x <- case y of
(CInt x1) -> _prim_string_print x1
pure 1 -- pure (CInt 1)
pure ()
|]
let after = withPrimPrelude [prog|
grinMain =
y <- pure (CInt #"str")
x <- case y of
(CInt x1) -> _prim_string_print x1
pure 1
pure ()
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
describe "Simple dead variable elimination works for" $ do
it "simple" $ do
let before = [prog|
grinMain =
i1 <- pure 1
n1 <- pure (CNode i1)
p1 <- store n1
p2 <- store (CNode p1)
pure 0
|]
let after = [prog|
grinMain =
pure 0
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
it "pure case" $ do
let before = [prog|
grinMain =
i1 <- pure 1
n1 <- pure (CNode i1)
p1 <- store n1
p2 <- store (CNode p1)
_prim_int_print i1
i2 <- case n1 of
1 -> pure 2
2 -> pure 3
#default -> pure 4
pure 0
|]
let after = [prog|
grinMain =
i1 <- pure 1
_prim_int_print i1
pure 0
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
it "effectful case" $ do
let before = [prog|
grinMain =
i1 <- pure 1
n1 <- pure (CNode i1)
p1 <- store n1
p2 <- store (CNode p1)
_prim_int_print i1
case n1 of
1 -> pure ()
2 -> _prim_int_print 3
#default -> pure ()
pure 0
|]
let after = [prog|
grinMain =
i1 <- pure 1
n1 <- pure (CNode i1)
_prim_int_print i1
case n1 of
1 -> pure ()
2 -> _prim_int_print 3
#default -> pure ()
pure 0
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
it "nested effectful case" $ do
let before = [prog|
grinMain =
i1 <- pure 1
n1 <- pure (CNode i1)
p1 <- store n1
n2 <- pure (CNode p1)
p2 <- store n2
_prim_int_print i1
case n1 of
1 ->
i2 <- case n2 of
0 -> pure 1
#default -> pure 2
pure ()
2 -> _prim_int_print 3
#default -> pure ()
pure 0
|]
let after = [prog|
grinMain =
i1 <- pure 1
n1 <- pure (CNode i1)
_prim_int_print i1
case n1 of
1 -> pure ()
2 -> _prim_int_print 3
#default -> pure ()
pure 0
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
it "node pattern" $ do
let before = [prog|
grinMain =
i1 <- pure 1
(CNode i2) <- pure (CNode i1)
(CNode i3) <- pure (CNode i1)
n1 <- pure (CNode i2)
(CNode i4) <- pure n1
pure i1
|]
let after = [prog|
grinMain =
i1 <- pure 1
pure i1
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
it "pattern match" $ do
let before = [prog|
grinMain =
n1 <- pure (CNode 0)
(CNode i3) <- pure n1
(CNil) <- pure (CNil)
(CUnit) <- pure (CUnit)
n2 <- pure (CNode i3)
(CNode i4) <- pure (CNode i3)
(CNode i5) <- pure n2
(CNode i6) <- pure n2
pure 0
|]
let after = [prog|
grinMain =
pure 0
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after
describe "interprocedural DVE regression tests" $ do
it "Not explicitly covered alternatives trigger undefined replacements" $ do
let before = [prog|
grinMain =
v0 <- _prim_int_add 1 1
v1 <- case v0 of
2 ->
v2 <- _prim_int_lt 1 3
v3 <- case v2 of
#False -> pure v0
#True -> pure 1
case v3 of
0 -> pure (CGT)
1 -> pure (CLT)
1 -> pure (CEQ)
-- If #default is changed to explicit alternatives the undefineds are not introduced.
-- Undefineds are introduced for missing alternatives too.
case v1 of
(CEQ) -> _prim_int_print 1
#default -> _prim_int_print 2
|]
let after = [prog|
grinMain =
v0 <- _prim_int_add 1 1
v1 <- case v0 of
2 ->
v2 <- _prim_int_lt 1 3
v3 <- case v2 of
#False -> pure v0
#True -> pure 1
case v3 of
0 -> pure (CGT)
1 -> pure (CLT)
1 -> pure (CEQ)
case v1 of
(CEQ) -> _prim_int_print 1
#default -> _prim_int_print 2
|]
let tyEnv = inferTypeEnv before
effMap = effectMap (tyEnv, before)
dveExp = simpleDeadVariableElimination tyEnv effMap before
dveExp `sameAs` after