demo
[cc1516.git] / gen.icl
1 implementation module gen
2
3 import StdMisc
4 import StdList
5 import StdOverloaded
6 import StdString
7 from StdFunc import id, const
8 import StdTuple
9 import StdEnum
10
11 import Data.Func
12 import qualified Data.Map as Map
13 import Data.List
14 import Data.Either
15 import Data.Tuple
16 import Data.Functor
17 import Data.Monoid
18 import Data.Maybe
19 import Control.Applicative
20 import Control.Monad
21 import Control.Monad.Trans
22 from Text import class Text(concat), instance Text String
23
24 import AST
25 import RWST
26
27 TRUE :== -1
28 FALSE :== 0
29 :: Instr = Instr String [Arg] String
30 | Lab Label
31 :: Label :== String
32 :: Arg = L Label | Lit Int | Raw String
33 :: SSMProgram :== [Instr]
34 :: GenError = Error String
35 :: Addressbook :== 'Map'.Map String Address
36 :: Address = LAB String Int Int | ADDR Int Int
37 :: Gen a :== RWST () SSMProgram (Addressbook, [Label]) (Either GenError) a
38
39 labelStream :: [Label]
40 labelStream = ["lbl_" +++ toString i\\i<-[1..]]
41
42 defaultAddressBook :: [FunDecl] -> Addressbook
43 defaultAddressBook fd = extend "1printint" (LAB "1printint" 1 0)
44 $ extend "1printchar" (LAB "1printchar" 1 1)
45 $ extend "read" (LAB "read" 0 2)
46 $ extend "1readint" (LAB "1readint" 0 3)
47 $ extend "isEmpty" (LAB "isempty" 1 4)
48 $ addFuncs fd 5
49 where
50 addFuncs [] _ = 'Map'.newMap
51 addFuncs [(FunDecl _ k args _ _ _):xs] n =
52 extend k (LAB k (length args) n) $ addFuncs xs (n+1)
53
54 gen :: AST -> Either String String
55 gen (AST fds) = case evalRWST prog () (defaultAddressBook fds, labelStream) of
56 Left (Error e) = Left e
57 Right (_, p) = Right $ toString p
58 where
59 prog = tell [
60 Instr "bsr" [L "main"] "",
61 Instr "halt" [] ""
62 ] >>| tell (programContext fds)
63 >>| mapM_ g fds
64
65 programContext :: [FunDecl] -> SSMProgram
66 programContext x = [Lab "1func"
67 :fS ["1printint" ,"1printchar"
68 ,"read" ,"1readint"
69 ,"isEmpty":map (\(FunDecl _ k _ _ _ _)->k) x] 0] ++ context
70 where
71
72 fS :: [String] Int -> SSMProgram
73 fS [] _ = []
74 fS [k:xs] n = [
75 Lab $ "1next" +++ toString n
76 ,Instr "ldr" [Raw "R5"] ""
77 ,Instr "ldc" [Lit n] $ "branch to: " +++ k
78 ,Instr "eq" [] ""
79 ,Instr "brf" [L $ "1next" +++ (toString $ n + 1)] ""
80 ,Instr "bra" [L k] ""
81 :fS xs $ n+1]
82 context :: SSMProgram
83 context = [Lab "1printint"
84 ,Instr "link" [Lit 0] ""
85 ,Instr "ldl" [Lit -2] "load first argument"
86 ,Instr "trap" [Lit 0] "print int"
87 ,Instr "unlink" [] ""
88 ,Instr "ret" [] ""
89 ,Lab "1printchar"
90 ,Instr "link" [Lit 0] ""
91 ,Instr "ldl" [Lit -2] "load first argument"
92 ,Instr "trap" [Lit 1] "print char"
93 ,Instr "unlink" [] ""
94 ,Instr "ret" [] ""
95 ,Lab "read"
96 ,Instr "link" [Lit 0] ""
97 ,Instr "trap" [Lit 11] "read char"
98 ,Instr "str" [Raw "RR"] ""
99 ,Instr "unlink" [] ""
100 ,Instr "ret" [] ""
101 ,Lab "isempty"
102 ,Instr "link" [Lit 0] ""
103 ,Instr "ldl" [Lit -2] "load prt to list"
104 ,Instr "lda" [Lit 0] "derefrence ptr"
105 ,Instr "ldc" [Lit 0] ""
106 ,Instr "eq" [] "test for null pointer"
107 ,Instr "str" [Raw "RR"] ""
108 ,Instr "unlink" [] ""
109 ,Instr "ret" [] ""
110 ,Lab "read"
111 ]
112
113 getAdressbook :: Gen Addressbook
114 getAdressbook = gets fst
115
116 updateAdressbook :: (Addressbook -> Addressbook) -> Gen Addressbook
117 updateAdressbook f = modify (appFst f) >>| getAdressbook
118
119 extend :: String Address Addressbook -> Addressbook
120 extend k pl g = 'Map'.put k pl g
121
122 fresh :: Gen Label
123 fresh = gets snd >>= \vars->
124 modify (appSnd $ const $ tail vars) >>|
125 pure (head vars)
126
127 class g a :: a -> Gen ()
128
129 instance g Op1 where
130 g UnNegation = tell [Instr "not" [] ""]
131 g UnMinus = tell [Instr "neg" [] ""]
132
133 instance g Op2 where
134 g o = tell [Instr s [] ""]
135 where
136 s = case o of
137 BiPlus = "add"
138 BiMinus = "sub"
139 BiTimes = "mul"
140 BiDivide = "div"
141 BiMod = "mod"
142 BiEquals = "eq"
143 BiLesser = "lt"
144 BiGreater = "gt"
145 BiLesserEq = "le"
146 BiGreaterEq = "ge"
147 BiUnEqual = "ne"
148 BiAnd = "and"
149 BiOr = "or"
150 BiCons = abort "Shit, Cons, how to deal with this?"
151
152 instance g FieldSelector where
153 g FieldFst = tell [Instr "lda" [Lit -1] "fst"]
154 g FieldSnd = tell [Instr "lda" [Lit 0] "snd"]
155 g FieldHd = tell [Instr "lda" [Lit -1] "hd"]
156 g FieldTl = tell [Instr "lda" [Lit 0] "tl"]
157
158 instance g Expr where
159 g (IntExpr _ i) = tell [Instr "ldc" [Lit i] ""]
160 g (CharExpr _ c) = tell [Instr "ldc" [Lit (toInt c)] ""]
161 g (BoolExpr _ b) = tell [Instr "ldc" [Lit (if b TRUE FALSE)] ""]
162 g (EmptyListExpr _) = tell [Instr "ldc" [Lit 0] ""]
163 >>| tell [Instr "sth" [] ""]
164 g (Op1Expr _ o e) = g e >>| g o
165 g (Op2Expr _ e1 BiCons e2) = g e2 >>| g e1
166 >>| tell [Instr "sth" [] ""]
167 >>| tell [Instr "ajs" [Lit -1] ""]
168 >>| tell [Instr "sth" [] ""]
169 g (Op2Expr _ e1 op e2) = g e1 >>| g e2 >>| g op
170 g (TupleExpr _ (e1,e2)) = g e1
171 >>| g e2
172 >>| tell [Instr "stmh" [Lit 2] ""]
173 g (VarExpr _ (VarDef k fs)) = getAdressbook >>= \ab->case 'Map'.get k ab of
174 Just (ADDR t arity) = tell [Instr "ldl" [Lit t] ""] >>| mapM_ g fs >>| pure ()
175 Just (LAB l _ fn) = tell
176 [Instr "ldc" [Lit fn] ""
177 ,Instr "sth" [] ""
178 ,Instr "ldc" [Lit 0] ""
179 ,Instr "sth" [] ""
180 ,Instr "ajs" [Lit -1] ""]
181 g (FunExpr _ k es fs) = funnyStuff k es fs
182
183 funnyStuff :: String [Expr] [FieldSelector] -> Gen ()
184 funnyStuff k es fs = getAdressbook >>= \ab->case 'Map'.get k ab of
185 //Identifier points to function
186 Just (LAB l arity fn) = if (arity <> (length es))
187 //Function is not complete
188 ( tell
189 [Instr "ldc" [Lit fn] "Store function number"
190 ,Instr "sth" [] ""
191 ,Instr "ldc" [Lit $ length es] "Store arity"
192 ,Instr "sth" [] ""
193 ,Instr "ajs" [Lit -1] ""]
194 >>| mapM_ g es
195 >>| if (isEmpty es) (pure ()) (tell
196 [Instr "stmh" [Lit $ length es] "Store arguments"
197 ,Instr "ajs" [Lit -1] ""]))
198 //Function is complete
199 ( mapM_ g es
200 >>| getAdressbook >>= \ab->(case 'Map'.get k ab of
201 Nothing = liftT (Left $ Error $ concat ["PANIC: ", k, " not found as function"])
202 Just (LAB t _ _) = tell [Instr "bsr" [L t] (k +++"()")]
203 Just (ADDR t arity) = liftT (Left $ Error "NO ADDRESS JUMPING FFS")
204 )
205 >>| tell
206 [Instr "ajs" [Lit $ ~(length es)] "Clean arguments"
207 ,Instr "ldr" [Raw "RR"] ""])
208 //Identifier points to variable, thus higher order function
209 Just (ADDR t arity) = if (arity <> (length es))
210 //Function is still not complete
211 ( fresh >>= \finish->fresh >>= \start->tell [
212 //Store function number
213 Instr "ldl" [Lit t] "STARTING HIGHER ORDER UPDATE"
214 ,Instr "ldh" [Lit 0] "get function number"
215 ,Instr "sth" [] "Store"
216 //Store function arity
217 ,Instr "ldl" [Lit t] "get pointer again"
218 ,Instr "ldh" [Lit 1] "get function arity"
219 ,Instr "ldc" [Lit $ length es] "add argument number"
220 ,Instr "add" [] "add"
221 ,Instr "sth" [] "Store"
222 ,Instr "ajs" [Lit -1] "Adjust pointer"
223 //load the arguments
224 ,Instr "ldl" [Lit t] ""
225 ,Instr "ldh" [Lit 1] "Load available arguments"
226 ,Instr "str" [Raw "R5"] "Store available args in register"
227 ,Instr "ldc" [Lit 0] "Store offset"
228 ,Instr "str" [Raw "R6"] "Store offset in register"
229 ,Lab start
230 ,Instr "ldr" [Raw "R5"] ""
231 ,Instr "ldc" [Lit 0] ""
232 ,Instr "eq" [] ""
233 ,Instr "brt" [L finish] "Done pushing arg, bye"
234 //Load heapadress
235 ,Instr "ldl" [Lit t] ""
236 ,Instr "ldr" [Raw "R6"] ""
237 ,Instr "add" [] "Corrected heapaddress"
238 ,Instr "ldh" [Lit 2] "Load argument"
239 ,Instr "sth" [] "And store it immediatly after"
240 //Decrease available arguments
241 ,Instr "ldr" [Raw "R5"] ""
242 ,Instr "ldc" [Lit 1] ""
243 ,Instr "sub" [] ""
244 ,Instr "str" [Raw "R5"] ""
245 //Increase available arguments
246 ,Instr "ldr" [Raw "R6"] ""
247 ,Instr "ldc" [Lit 1] ""
248 ,Instr "add" [] ""
249 ,Instr "str" [Raw "R6"] ""
250 ,Instr "bra" [L start] ""
251 ,Lab finish
252 ]
253 >>| mapM_ g es
254 >>| tell
255 [Instr "stmh" [Lit $ length es] "Store extra args"
256 ,Instr "ajs" [Lit -1] ""]
257 )
258 //Function is complete
259 ( fresh >>= \finish->fresh >>= \start->tell [
260 Instr "ldl" [Lit t] "STARTING HIGHER ORDER CALL"
261 ,Instr "ldh" [Lit 1] "Load available arguments"
262 ,Instr "str" [Raw "R5"] "Store available args in register"
263 ,Instr "ldc" [Lit 0] "Store offset"
264 ,Instr "str" [Raw "R6"] "Store offset in register"
265
266 ,Lab start
267 ,Instr "ldr" [Raw "R5"] ""
268 ,Instr "ldc" [Lit 0] ""
269 ,Instr "eq" [] ""
270 ,Instr "brt" [L finish] "Done pushing arg, bye"
271 //Load heapadress
272 ,Instr "ldl" [Lit t] ""
273 ,Instr "ldr" [Raw "R6"] ""
274 ,Instr "add" [] "Corrected heapaddress"
275 ,Instr "ldh" [Lit 2] "Load argument"
276 //Decrease available arguments
277 ,Instr "ldr" [Raw "R5"] ""
278 ,Instr "ldc" [Lit 1] ""
279 ,Instr "sub" [] ""
280 ,Instr "str" [Raw "R5"] ""
281 //Increase available arguments
282 ,Instr "ldr" [Raw "R6"] ""
283 ,Instr "ldc" [Lit 1] ""
284 ,Instr "add" [] ""
285 ,Instr "str" [Raw "R6"] ""
286 ,Instr "bra" [L start] ""
287 ,Lab finish
288 ]
289 >>| mapM_ g es
290 >>| tell
291 [Instr "ldl" [Lit t] ""
292 ,Instr "ldh" [Lit 0] "Get function number"
293 ,Instr "str" [Raw "R5"] ""
294 ,Instr "bsr" [L "1func"] "HIGHER ORDER END"
295 ,Instr "ldl" [Lit t] ""
296 ,Instr "ldh" [Lit 1] ""
297 ,Instr "neg" [] ""
298 ,Instr "ldr" [Raw "SP"] ""
299 ,Instr "add" [] ""
300 ,Instr "ldc" [Lit $ length es + 1] ""
301 ,Instr "sub" [] ""
302 ,Instr "str" [Raw "SP"] ""
303 ,Instr "ldr" [Raw "RR"] ""
304 ]
305 )
306 Nothing = liftT (Left $ Error "Undefined function!!!")
307
308 instance g Stmt where
309 g (IfStmt cond th el) =
310 fresh >>= \elseLabel->
311 fresh >>= \endLabel->
312 g cond >>|
313 tell [Instr "brf" [L elseLabel] "branch else"] >>|
314 mapM_ g th >>|
315 tell [Instr "bra" [L endLabel] "branch end if"] >>|
316 tell [Lab elseLabel] >>|
317 mapM_ g el >>|
318 tell [Lab endLabel]
319 g (WhileStmt cond th) =
320 fresh >>= \startLabel->
321 fresh >>= \endLabel ->
322 tell [Lab startLabel] >>|
323 g cond >>|
324 tell [Instr "brf" [L endLabel] "branch end while"] >>|
325 mapM_ g th >>|
326 tell [Instr "bra" [L startLabel] "branch start while"] >>|
327 tell [Lab endLabel]
328 g (AssStmt (VarDef k fs) e) =
329 g e >>| getAdressbook >>= \ab->case 'Map'.get k ab of
330 Nothing = liftT (Left $ Error $ concat ["PANIC: ", k, " not found as var"])
331 Just (LAB t _ _) = liftT (Left $ Error $ "PANIC: cannot assign to function")
332 Just (ADDR t ar) = tell [Instr "stl" [Lit t] ""]
333 g (FunStmt k es fs) = funnyStuff k es fs
334 g (ReturnStmt Nothing) = tell [Instr "unlink" [] ""]
335 >>| tell [Instr "ret" [] ""]
336 g (ReturnStmt (Just e)) = g e
337 >>| tell [Instr "str" [Raw "RR"] ""]
338 >>| g (ReturnStmt Nothing)
339
340 foldVarDecl :: Int VarDecl -> Gen Int
341 foldVarDecl x (VarDecl _ mt k e) = g e
342 >>| annote x k
343 >>| updateAdressbook (extend k (ADDR x $ arity $ fromJust mt))
344 >>| pure (x + 1)
345
346 arity :: Type -> Int
347 arity (_ ->> x) = 1 + arity x
348 arity _ = 0
349
350 addVars :: Type [String] -> (Addressbook -> Addressbook)
351 addVars _ [] = id
352 addVars (t ->> ts) [x:xs] = \ab->
353 extend x (ADDR (-2 - (length xs)) (arity t)) (addVars ts xs ab)
354 addVars t [x] = \ab->
355 extend x (ADDR -2 0) ab
356
357 instance g FunDecl where
358 g (FunDecl _ k args mt vds stms) =
359 //varDecls can call the enclosing function, so first reserve a label for it
360 getAdressbook >>= \oldMap ->
361 updateAdressbook (addVars (fromJust mt) args) >>|
362 tell [Lab k] >>|
363 tell [Instr "link" [Lit 0] ""] >>|
364 //add the vars
365 foldM foldVarDecl 1 vds >>|
366 //and the statements
367 mapM_ g stms >>|
368 //Ugly hack to always return
369 g (ReturnStmt Nothing) >>|
370 updateAdressbook (const oldMap) >>| pure ()
371
372 annote :: Int String -> Gen ()
373 annote pos key =
374 tell [Instr "annote" [Raw "MP", Lit pos, Lit pos, Raw "black", Raw key] ""]
375
376 class print a :: a -> [String]
377
378 instance print Instr where
379 print (Lab l) = [l, ":", "\n"]
380 print (Instr i args com) = ["\t", i] ++ print args ++ [" ;", com, "\n"]
381
382 instance print [Arg] where
383 print args = (map toString args)
384
385 instance toString Arg where
386 toString (L l) = l
387 toString (Lit int) = toString int
388 toString (Raw s) = s
389
390 instance toString SSMProgram where
391 toString p = concat $ intersperse " " $ map (\i-> concat $ intersperse " " $ print i) p