X-Git-Url: https://git.martlubbers.net/?a=blobdiff_plain;f=gen.icl;h=a37fedf060fc18e27eabf4bf4617e20c4ec8143d;hb=e01254ee33ddd811fe95ea98cba19909f3e4f740;hp=06d2b1306adfa7d3dfe84e289599426899741f60;hpb=a704ddfa169139f2d8595dd7023011e49843faa9;p=cc1516.git diff --git a/gen.icl b/gen.icl index 06d2b13..a37fedf 100644 --- a/gen.icl +++ b/gen.icl @@ -1,12 +1,12 @@ implementation module gen - import StdMisc import StdList import StdOverloaded import StdString -from StdFunc import id +from StdFunc import id, const import StdTuple +import StdEnum import Data.Func import qualified Data.Map as Map @@ -15,6 +15,7 @@ import Data.Either import Data.Tuple import Data.Functor import Data.Monoid +import Data.Maybe import Control.Applicative import Control.Monad import Control.Monad.Trans @@ -23,48 +24,128 @@ from Text import class Text(concat), instance Text String import AST import RWST -//Instruction is an instruction, with possible arguments and a possible comment -//Or is a label TRUE :== -1 FALSE :== 0 :: Instr = Instr String [Arg] String - | Lab String + | Lab Label :: Label :== String -:: Arg = L Label | Lit Int +:: Arg = L Label | Lit Int | Raw String :: SSMProgram :== [Instr] - - -gen :: AST -> String -gen _ = toString [Lab "Test" - ,Instr "ldc" [Lit 1] "Eerste instructie" - ,Instr "ldc" [Lit 2] "Tweede instructie"] - - -//Scrap this, we'll need shared state when generating -//i.e. to figure out the positions of vars relative to the -//SP/MP/whatever or in which register they are -//and to supply with fresh labels - -//The generation monad :: GenError = Error String :: GenMap :== 'Map'.Map String LoadPlace +//completely change to either Stack, Heap, Register? :: LoadPlace = LDA Int | LDC Int | LDH Int | LDL Int | LDR Int | LDS Int | FUNC Label -:: Gen a :== RWST [Int] SSMProgram (GenMap, [Label]) (Either GenError) a - +:: Gen a :== RWST Label SSMProgram (GenMap, [Label]) (Either GenError) a + +labelStream :: [Label] +labelStream = ["lbl_" +++ toString i\\i<-[1..]] + +gen :: AST -> Either String String +gen (AST fds) = case evalRWST prog "" ('Map'.newMap, labelStream) of + Left (Error e) = Left e + Right (_, p) = Right $ toString p + where + prog = tell [Instr "bra" [L "main"] ""] >>| mapM_ g fds + +//Current issues: +//All VarDecls are added as function, how to deal with assignments? +// (And when we deal with assignments, how to deal with assignments to higher order functions?) +//Dealing with arguments +//Dealing with types that do not fit on the Stack +// Probably completely change LoadPlace to a Type and a position relative to *something* +// And where the type determines if this position is a pointer to the heap or an +// unboxed value + +//helper functions for the gen monad genMap :: Gen GenMap genMap = gets fst +changeGenMap :: (GenMap -> GenMap) -> Gen GenMap +changeGenMap f = modify (appFst f) >>| genMap + +extend :: String LoadPlace GenMap -> GenMap +extend k pl g = 'Map'.put k pl g + +fresh :: Gen Label +fresh = gets snd >>= \vars-> + modify (appSnd $ const $ tail vars) >>| + pure (head vars) + class g a :: a -> Gen () instance g Expr where g (VarExpr _ (VarDef k fs)) = load k >>= \instr-> tell [instr] //note: pure is pure for list, i.e. [] g (IntExpr _ i) = loadP (LDC i) >>= \instr-> tell [instr] - g (CharExpr _ c) = undef //how to deal with strings? + g (CharExpr _ c) = abort "How to deal with chars?" g (BoolExpr _ True) = loadP (LDC TRUE) >>= \instr-> tell [instr] g (BoolExpr _ False) = loadP (LDC FALSE) >>= \instr-> tell [instr] g (Op2Expr _ e1 op e2) = g e1 >>| g e2 >>| tell [Instr (op2ins op) [] ""] + g (Op1Expr _ UnNegation e) = g e >>| tell [Instr "not" [] ""] + g (Op1Expr _ UnMinus e) = g e >>| tell [Instr "neg" [] ""] + g (EmptyListExpr _) = abort "Shit, empty list expr" + g (TupleExpr p (e1,e2)) = abort "How to deal with tuples?" + g (FunExpr _ k es fs) = + mapM g es >>| //put all arguments on the stack (todo: fix argument handling!) + jump "bsr" k >>= \instr-> + tell [instr] >>| //actually branch to function + tell [Instr "ldr" [Raw "RR"] ""] //push return value on stack, todo: check for VOID + +instance g Stmt where + g (IfStmt cond th el) = + fresh >>= \elseLabel-> + fresh >>= \endLabel-> + g cond >>| + tell [Instr "brf" [L elseLabel] "branch else"] >>| + mapM_ g th >>| + tell [Instr "bra" [L endLabel] "branch end if"] >>| + tell [Lab elseLabel] >>| + mapM_ g el >>| + tell [Lab endLabel] + g (WhileStmt cond th) = + fresh >>= \startLabel-> + fresh >>= \endLabel -> + tell [Lab startLabel] >>| + g cond >>| + tell [Instr "brf" [L endLabel] "branch end while"] >>| + mapM_ g th >>| + tell [Instr "bra" [L startLabel] "branch start while"] >>| + tell [Lab endLabel] + g (AssStmt (VarDef k fs) e) = + g e >>| + abort "Shit, an assignment, figure out something with storing vars or something" + //vars will be on stack in locals (possible pointers to heap) + g (FunStmt _ _) = abort "CodeGen, FunStmt unused" //not used + g (ReturnStmt Nothing) = tell [Instr "ret" [] ""] //NOTE! Assumes only return address on stack, safe? + g (ReturnStmt (Just e)) = + g e >>| + tell [Instr "str" [Raw "RR"] ""] >>| + g (ReturnStmt Nothing) + +instance g VarDecl where + g (VarDecl _ Nothing _ _) = liftT (Left $ Error "PANIC: untyped vardecl") + g (VarDecl _ (Just t) k e) = + (\l->k+++"_"+++l) <$> fresh >>= \lbl-> + changeGenMap (extend k (FUNC lbl)) >>| + tell [Lab lbl] >>| + g e >>| + tell [Instr "str" [Raw "RR"] ""] >>| + tell [Instr "ret" [] ""] + + +instance g FunDecl where + g (FunDecl _ k _ _ vds stms) = + //varDecls can call the enclosing function, so first reserve a label for it + (\l-> if (k=="main") "main" (l+++"_"+++k)) <$> fresh >>= \lbl-> + changeGenMap (extend k (FUNC lbl)) >>| + //then generate functions for the VarDecls + genMap >>= \oldMap -> + mapM_ g vds >>| + //then the main function + tell [Lab lbl] >>| + mapM_ g stms >>| + changeGenMap (const oldMap) >>| pure () op2ins :: Op2 -> String op2ins op = case op of @@ -103,7 +184,7 @@ where jump :: String String -> Gen Instr jump instr k = genMap >>= \g-> case 'Map'.member k g of False = liftT (Left $ Error $ concat ["PANIC: ", k, " not found as function"]) - True = dec ('Map'.find k g) >>= \lbl-> pure $ Instr instr [lbl] k + True = dec ('Map'.find k g) >>= \lbl-> pure $ Instr instr [lbl] (k +++"()") where dec (FUNC l) = pure (L l) dec _ = liftT (Left $ Error "PANIC: trying to jump to non label") @@ -120,6 +201,7 @@ instance print [Arg] where instance toString Arg where toString (L l) = l toString (Lit int) = toString int + toString (Raw s) = s instance toString SSMProgram where - toString p = concat $ intersperse " " $ map (\i-> concat $ intersperse " " $ print i) p \ No newline at end of file + toString p = concat $ intersperse " " $ map (\i-> concat $ intersperse " " $ print i) p