forked from UU-ComputerScience/uhc
/
GRIRun.chs
409 lines (371 loc) · 16.5 KB
/
GRIRun.chs
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
408
% $Id: GRI.lag 199 2004-05-12 19:11:13Z andres $
%%[0
%include lhs2TeX.fmt
%include afp.fmt
%%]
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% Run GRI
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%[8 module GRIRun import(EHCommon,GRICommon,GrinCode,GrinCodePretty)
%%]
%%[8 import(FiniteMap,Maybe,Data.Array,Data.Array.IO)
%%]
%%[8 import(UU.Pretty) export(ppRunState)
%%]
%%[8 export(RunState(..),RunHeap(..),RunVal(..),RunLoc,RunEnv,run1Step,mkRN,NdCat(..),rvHole)
%%]
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% Machine values
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%[8
data NdCat = NdCon | NdHole | NdRec | NdApp | NdFun | NdPApp deriving (Enum,Eq,Ord,Show)
data RunVal
= RVNil
| RVCat !NdCat
| RVInt !Int
| RVNode !(Array Int RunVal)
| RVPtr !Int
| RVGlob !HsName ![HsName] !GrExpr
mkRN :: [RunVal] -> RunVal
mkRN es = RVNode (listArray (0,length es - 1) es)
rvHole :: RunVal
rvHole = mkRN [RVCat NdHole]
instance Show RunVal where
show v = "VAL"
instance PP RunVal where
pp (RVNil ) = pp "-:-"
pp (RVCat v ) = "C:" >|< pp (drop 2 (show v))
pp (RVInt v ) = "I:" >|< pp v
pp (RVNode v ) = "N:" >|< ppListSep "(" ")" " " (elems v)
pp (RVPtr v ) = "P:" >|< pp v
pp (RVGlob v _ _ ) = "G:" >|< pp v
%%]
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% Machine state, memory
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%[8
type RunLoc = Maybe GrExpr
data RunHeap = RunHeap {rhMem :: !(IOArray Int RunVal), rhSize :: !Int, rhFree :: !Int}
type RunEnv = FiniteMap HsName RunVal
data RunState
= RunState
{ rsNext :: !RunLoc
, rsStack :: ![(GrPat,GrExpr,RunEnv)]
, rsEnv :: !RunEnv
, rsGlobEnv :: !RunEnv
, rsHeap :: !RunHeap
, rsHalted :: Maybe PP_Doc
, rsNrSteps :: !Int
}
rsVar :: RunState -> HsName -> RunVal
rsVar rs = lookupWithDefaultFM (rsEnv rs) RVNil
rsDeref :: RunState -> RunVal -> IO RunVal
rsDeref rs r
= case r of
RVPtr p | p < rhFree h -> readArray (rhMem h) p
| otherwise -> return RVNil
where h = rsHeap rs
_ -> return r
rsVarDeref :: RunState -> HsName -> IO RunVal
rsVarDeref rs = rsDeref rs . rsVar rs
ppRunHeap :: RunHeap -> IO PP_Doc
ppRunHeap h
= do { m <- getAssocs . rhMem $ h
; return
("HEAP sz=" >|< rhSize h >|< " fr=" >|< rhFree h
>-< indent 2 (ppAssocL m))
}
ppRunState :: RunState -> IO PP_Doc
ppRunState rs
= do { h <- ppRunHeap (rsHeap rs)
; return
("STATE next=" >|< maybe empty ppGrExpr (rsNext rs)
>-< indent 2
(h
>-< "ENV" >#< (ppFM . rsEnv $ rs)
>-< "STK" >#< (vlist . map (\(p,rs,_) -> ppGrPat p >#< "->" >#< ppGrExpr rs) . rsStack $ rs)
))
}
%%]
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% Primitives
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%[8
primMp :: FiniteMap String (RunState -> [RunVal] -> IO (RunState,Maybe RunVal))
primMp
= listToFM
[ (show hsnPrimAddInt
,\rs [RVInt i1,RVInt i2] -> return (rs,Just (RVInt (i1 + i2)))
)
, ("primDivInt"
,\rs [RVInt i1,RVInt i2] -> return (rs,Just (RVInt (i1 `div` i2)))
)
, ("primMulInt"
,\rs [RVInt i1,RVInt i2] -> return (rs,Just (RVInt (i1 * i2)))
)
, ("primSubInt"
,\rs [RVInt i1,RVInt i2] -> return (rs,Just (RVInt (i1 - i2)))
)
, ("primCmpInt"
,\rs [RVInt i1,RVInt i2] -> let c = case i1 `compare` i2 of {EQ->0; GT->1; LT->2}
in return (rs,Just (mkRN [RVCat NdCon,RVInt c,RVInt 0]))
)
]
%%]
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% Running the machine
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%[8
grEvalTag :: RunState -> GrTag -> Int -> [RunVal]
grEvalTag rs t sz
= case t of
GrTag_Lit GrTagCon i _ -> [RVCat NdCon,RVInt i] -- ,RVInt sz]
GrTag_Lit GrTagHole _ _ -> [RVCat NdHole]
GrTag_Lit GrTagRec _ _ -> [RVCat NdRec,RVInt 0] -- ,RVInt sz]
GrTag_Lit GrTagFun i n -> [RVCat NdFun,rsVar rs n]
GrTag_Lit GrTagApp _ _ -> [RVCat NdApp]
GrTag_Lit (GrTagPApp nMiss) _ n -> [RVCat NdPApp,RVInt nMiss,rsVar rs n]
%%]
%%[8
grEvalVal :: RunState -> GrVal -> RunVal
grEvalVal rs v
= case v of
GrVal_Node t fL -> mkRN (grEvalTag rs t (length fL) ++ map (grEvalVal rs) fL)
GrVal_NodeAdapt r adL -> case rsVar rs r of
RVNode a
-> case elems a of
(c:t:RVInt sz:fL)
-> mkRN (c:t:RVInt (length fL'):fL')
where fL' = ad adL fL 0
ad (GrAdapt_Ins o v:adL') fL fO | o' == fO
= grEvalVal rs v : fL'
where fL' = ad adL' fL fO
(RVInt o') = grEvalVal rs o
ad (GrAdapt_Upd o v:adL') (_:fL) fO | o' == fO
= grEvalVal rs v : fL'
where fL' = ad adL' fL (fO+1)
(RVInt o') = grEvalVal rs o
ad adL (f:fL) fO
= f : fL'
where fL' = ad adL fL (fO+1)
ad [] fL _
= fL
GrVal_LitInt i -> RVInt i
GrVal_Var n -> rsVar rs n
GrVal_Empty -> RVNil
%%]
%%[8
grCall :: RunState -> RunVal -> [RunVal] -> RunState
grCall rs f aL
= case f of
RVGlob _ nL e
-> rs'
where re = rsGlobEnv rs `plusFM` listToFM (zip nL aL)
rs' = rs {rsEnv = re, rsNext = Just e}
%%]
%%[8
grFFI :: RunState -> String -> [RunVal] -> IO (RunState,Maybe RunVal)
grFFI rs f aL
= case lookupFM primMp f of
Just f'
-> f' rs aL
_ -> do { rs' <- halt rs ("No ffi for:" >#< f >-< indent 2 ("with args:" >#< (ppCommaList . map pp $ aL)))
; return (rs',Nothing)
}
%%]
%%[8
grEvalApp :: RunState -> RunVal -> GrValL -> IO (RunState,Maybe RunVal)
grEvalApp rs f aL
= let aLSz = length aL
in case f of
RVNode a
-> case elems a of
(RVCat NdPApp:RVInt ndMiss:ndF:ndAL) | aLSz > ndMiss
-> do { ndF' <- rsDeref rs' ndF
; return (grCall rs' ndF' (ndAL ++ (map (grEvalVal rs) (take ndMiss aL))),Nothing)
}
where n = hsnWild
e = GrExpr_App n (drop ndMiss aL)
stk = (GrPat_Var n,e,rsEnv rs) : rsStack rs
rs' = rs {rsStack = stk, rsNext = Just e}
(RVCat NdPApp:RVInt ndMiss:ndF:ndAL) | aLSz == ndMiss
-> do { ndF' <- rsDeref rs ndF
; return (grCall rs ndF' (ndAL ++ (map (grEvalVal rs) aL)),Nothing)
}
(RVCat NdPApp:RVInt ndMiss:ndF:ndAL)
-> return (rs,Just (mkRN ([RVCat NdPApp,RVInt (ndMiss-aLSz),ndF] ++ ndAL ++ (map (grEvalVal rs) aL))))
_ -> return (rs,Just f)
%%]
%%[8
rsCheckMem :: RunState -> IO RunState
rsCheckMem rs
= let h = rsHeap rs
m = rhMem h
in if rhFree h < rhSize h
then return rs
else do { let newSz = 3 * rhSize h `div` 2
; elts <- getElems m
; let elts' = elts ++ replicate (newSz - rhSize h) RVNil
; m' <- newListArray (0,newSz-1) elts'
; let h' = h {rhSize = newSz, rhMem = m'}
; return (rs {rsHeap = h'})
}
%%]
%%[8
grEvalExpr :: RunState -> GrExpr -> IO (RunState,Maybe RunVal)
grEvalExpr rs e
= case e of
GrExpr_Unit v
-> return (rs,Just (grEvalVal rs v))
GrExpr_Fetch n _
-> do { n' <- rsVarDeref rs n
; return (rs,Just n')
}
GrExpr_Store v
-> do { rs2 <- rsCheckMem rs
; let h = rsHeap rs2
m = rhMem h
p = rhFree h
rv = grEvalVal rs v
; rv `seq` writeArray (rhMem h) p rv
; return (rs2 {rsHeap = h {rhFree = p+1}},Just (RVPtr p))
}
GrExpr_Update n v
-> do { let (RVPtr p) = rsVar rs n
rv = grEvalVal rs v
; rv `seq` writeArray (rhMem . rsHeap $ rs) p rv
; return (rs,Just RVNil)
}
GrExpr_Call fn aL
-> do { fn' <- rsVarDeref rs fn
; return (grCall rs fn' (map (grEvalVal rs) aL),Nothing)
}
GrExpr_FFI fn aL
-> grFFI rs fn (map (rsVar rs) aL)
GrExpr_App fn aL
-> grEvalApp rs (rsVar rs fn) aL
GrExpr_Eval n
-> let upd rs n
= let n2 = hsnWild
e = GrExpr_Seq (GrExpr_Update n (GrVal_Var n2)) (GrPat_Empty) (GrExpr_Unit (GrVal_Var n2))
stk = (GrPat_Var n2,e,rsEnv rs) : rsStack rs
in rs {rsStack = stk, rsNext = Just e}
in do { n' <- rsVarDeref rs n
; case n' of
v@(RVNode a)
-> case elems a of
(RVCat NdFun:ndF:ndAL)
-> do { ndF' <- rsDeref rs ndF
; return (grCall (upd rs n) ndF' ndAL,Nothing)
}
(RVCat NdApp:ndFAL)
-> return (rs3,Nothing)
where rs2 = upd rs n
n2 = hsnWild
nL@(nF:nAL) = take (length ndFAL) grLclNmSupplyL
e = GrExpr_Seq (GrExpr_Eval nF) (GrPat_Var n2) (GrExpr_App n2 (map GrVal_Var nAL))
re = rsGlobEnv rs `plusFM` listToFM (zip nL ndFAL)
rs3 = rs2 {rsNext = Just e, rsEnv = re}
_ -> return (rs,Just v)
v@RVNil
-> do { rs' <- halt rs ("Cannot be evaluated:" >#< pp v >-< indent 2 ("in:" >#< ppGrExpr e))
; return (rs',Nothing)
}
v -> return (rs,Just v)
}
GrExpr_Case v altL
-> case grEvalVal rs v of
nd@(RVNode a)
-> case elems a of
(RVCat NdCon:RVInt ndTg:ndAL)
-> let lookup t [] = Nothing
lookup t (GrAlt_Alt (GrPat_Node (GrTag_Lit _ t' _) fL) e:aL)
| t == t' = Just (fL,e)
| otherwise = lookup t aL
in case lookup ndTg altL of
Just (fL,e)
-> return (rs',Nothing)
where re = rsEnv rs `plusFM` listToFM (zip fL ndAL)
rs'= rs {rsEnv = re, rsNext = Just e}
Nothing
-> do { rs' <- halt rs ("No case alt for:" >#< pp nd >-< indent 2 ("in:" >#< ppGrExpr e))
; return (rs',Nothing)
}
(RVCat NdRec:_)
-> return (rs',Nothing)
where (GrAlt_Alt p e:_) = altL
re = grPatBind rs (rsEnv rs) nd p
rs'= rs {rsEnv = re, rsNext = Just e}
%%]
%%[8
grPatBind :: RunState -> RunEnv -> RunVal -> GrPat -> RunEnv
grPatBind rs re v p
= case p of
GrPat_Var n
-> addToFM re n v
GrPat_Empty
-> re
GrPat_Node _ pfL
-> case v of
RVNode a
-> case elems a of
(RVCat _:_:vfL)
-> re `plusFM` listToFM (zip pfL vfL)
GrPat_NodeSplit rNm splL
-> case v of
RVNode a
-> case elems a of
(c@(RVCat _):t:_:vfL)
-> re `plusFM` unitFM rNm (mkRN (c:t:RVInt (length r):r)) `plusFM` listToFM bL
where (r,bL) = spl splL vfL 0
spl (GrSplit_Sel n o:splL) (f:fL) fO | o' == fO
= (rfL,(n,f):bfL)
where (rfL,bfL) = spl splL fL (fO+1)
(RVInt o') = grEvalVal rs o
spl splL (f:fL) fO
= (f:rfL,bfL)
where (rfL,bfL) = spl splL fL (fO+1)
spl [] fL fO
= (fL,[])
%%]
%%[8
halt :: RunState -> PP_Doc -> IO RunState
halt rs p = return (rs {rsHalted = Just p})
%%]
%%[8
run1Expr :: RunState -> GrExpr -> IO RunState
run1Expr rs e
= do { rse <- grEvalExpr rs e
; case rse of
(rs,Just v) | null (rsStack rs)
-> do { v' <- rsDeref rs v
; halt rs ("Terminate ("
>|< rsNrSteps rs >#< "steps,"
>#< rhFree (rsHeap rs) >|< (pp_parens . pp . rhSize . rsHeap $ rs) >#< "nodes) with:"
>-< indent 2 (pp v')
)
}
(rs,Just v)
-> return rs2
where ((np,ne,re):stk) = rsStack rs
re' = v `seq` grPatBind rs re v np
rs2 = rs {rsEnv = re', rsNext = Just ne, rsStack = stk}
(rs,_)
-> return rs
}
%%]
%%[8
run1Step :: RunState -> IO RunState
run1Step rs
= do { case rsNext rs of
Nothing
-> halt rs (pp "No (more) instructions")
Just e
-> case e of
GrExpr_Seq e1 p e2
-> run1Expr rs' e1
where stk = (p,e2,rsEnv rs) : rsStack rs
rs' = rs {rsNext = Just e2, rsStack = stk, rsNrSteps = rsNrSteps rs + 1}
_ -> run1Expr (rs {rsNrSteps = rsNrSteps rs + 1}) e
}
%%]