1 {-# LANGUAGE GeneralizedNewtypeDeriving #-}
2 {-# LANGUAGE FlexibleContexts #-}
3 {-# LANGUAGE FlexibleInstances #-}
4 {-# LANGUAGE LambdaCase #-}
5 {-# LANGUAGE MultiParamTypeClasses #-}
11 import qualified Data.Map as DM
12 import Control.Monad.Writer
13 import Control.Monad.State
14 import Control.Monad.ST
20 newtype Compiler a = Compiler { unCompiler :: StateT CS (WriterT [Instr] (Either String)) a }
28 instance MonadFail Compiler where fail s = Compiler $ lift $ lift $ Left s
31 , functions :: DM.Map Int [Instr]
34 runCompiler :: Compiler a -> Either String [Instr]
35 runCompiler c = execWriterT
36 $ evalStateT (unCompiler (c >> instr [Halt] >> writeFunctions))
37 $ CS {fresh=[0..], functions=DM.empty}
39 writeFunctions :: Compiler ()
40 writeFunctions = gets (DM.elems . functions) >>= tell . concat
42 instr :: [Instr] -> Compiler a
43 instr i = tell i >> pure undefined
45 freshLabel :: Compiler Int
46 freshLabel = get >>= \cs->put (cs { fresh=tail (fresh cs) }) >> pure (head $ fresh cs)
48 binop :: Instr -> Compiler a1 -> Compiler a2 -> Compiler b
49 binop i l r = l >> r >> instr [i]
51 unop :: Instr -> Compiler a -> Compiler b
52 unop i l = l >> instr [i]
54 instance Expression Compiler where
55 lit v = instr $ map Push $ serialise v []
61 -- (^.) l r = freshLabel >>= \lblstart->freshLabel >>= \lblend->
62 -- l >> r >> instr -- pow (x, y) {
65 -- , Push 1 -- res = 1
66 -- , Lbl lblstart -- while
67 -- , Ldr 1 -- (y == 0)
71 -- , Ldr 0 -- res *= x
90 if' p t e = freshLabel >>= \elselabel-> freshLabel >>= \endiflabel->
91 p >> instr [Brf elselabel] >>
92 t >> instr [Bra endiflabel, Lbl elselabel] >>
93 e >> instr [Lbl endiflabel]
95 instance Function () Compiler where
97 freshLabel >>= \funlabel->
98 let g :- m = def (\()->instr [Jsr funlabel])
99 in liftFunction funlabel 0 (g ()) >> unmain m
101 instance Function (Compiler a) Compiler where
103 freshLabel >>= \funlabel->
104 let g :- m = def (\a->a >> instr [Jsr funlabel])
105 in liftFunction funlabel 1 (g (instr [Arg 0])) >> unmain m
107 instance Function (Compiler a, Compiler b) Compiler where
109 freshLabel >>= \funlabel->
110 let g :- m = def (\(a, b)->a >> b >> instr [Jsr funlabel])
111 in liftFunction funlabel 2 (g (instr [Arg 1], instr [Arg 0])) >> unmain m
113 instance Function (Compiler a, Compiler b, Compiler c) Compiler where
115 freshLabel >>= \funlabel->
116 let g :- m = def (\(a, b, c)->a >> b >> c >> instr [Jsr funlabel])
117 in liftFunction funlabel 3 (g (instr [Arg 2], instr [Arg 1], instr [Arg 0])) >> unmain m
119 liftFunction :: Int -> Int -> Compiler a -> Compiler ()
120 liftFunction lbl nargs body = do
121 is <- snd <$> censor (\_->[]) (listen body)
122 let instructions = Lbl lbl : is ++ [Ret nargs]
123 modify (\s->s { functions=DM.insert lbl instructions $ functions s })
126 = Push Int | Pop Int | Dup | Roll Int Int
127 | Add | Sub | Mul | Div | Neg | Pow
129 | Eq | Neq | Le | Ge | Leq | Geq
130 | Lbl Int | Bra Int | Brf Int
133 | Jsr Int | Ret Int | Arg Int
137 data Registers = Registers
142 , gp :: DM.Map Int Int
146 interpret :: Int -> [Instr] -> Array Int Int
147 interpret memsize prog = runSTArray $ do
148 program <- newListArray (0, length prog) prog
149 mem <- newArray (0, memsize-1) 0
150 int program mem (Registers {pc=0, sp=memsize-1, mp=0, hp=0, gp=DM.empty})
152 pushh :: STArray s Int Int -> Int -> Registers -> ST s Registers
153 pushh memory value reg = do
154 writeArray memory (hp reg) value
155 pure (reg { hp = hp reg + 1} )
157 loadh :: STArray s Int Int -> Int -> Registers -> ST s Registers
158 loadh memory hptr registers = readArray memory hptr >>= flip (push memory) registers
160 push :: STArray s Int Int -> Int -> Registers -> ST s Registers
161 push memory value reg = do
162 writeArray memory (sp reg) value
163 pure (reg { sp = sp reg - 1} )
165 pop :: STArray s Int Int -> Registers -> ST s (Registers, Int)
167 v <- readArray memory (sp reg + 1)
168 pure (reg { sp = sp reg + 1}, v)
170 popn :: STArray s Int Int -> Int -> Registers -> ST s (Registers, [Int])
171 popn _ 0 reg = pure (reg, [])
172 popn memory n reg = do
173 (reg', v) <- pop memory reg
174 (reg'', vs) <- popn memory (n - 1) reg'
177 bop :: (Int -> Int -> Int) -> STArray s Int Int -> Registers -> ST s Registers
178 bop op memory reg = do
179 (reg1, r) <- pop memory reg
180 uop (flip op r) memory reg1
182 uop :: (Int -> Int) -> STArray s Int Int -> Registers -> ST s Registers
183 uop op memory reg = do
184 (reg1, r) <- pop memory reg
185 push memory (op r) reg1
187 int :: STArray s Int Instr -> STArray s Int Int -> Registers -> ST s (STArray s Int Int)
188 int program memory registers = do
189 instruction <- readArray program $ pc registers
190 stack <- getElems memory
191 let reg = registers { pc = pc registers + 1 }
192 case trace ("Interpret: " ++ show instruction ++ " with registers: " ++ show registers ++ " and stack: " ++ show stack) instruction of
193 -- case instruction of
195 (reg', v) <- pop memory reg
196 int program memory $ reg' { gp = DM.insert r v (gp reg')}
197 Ldr r -> push memory (DM.findWithDefault 0 r $ gp reg) reg >>= int program memory
198 Roll 0 _ -> int program memory reg
199 Roll 1 _ -> int program memory reg
200 Roll _ 0 -> int program memory reg
202 (reg', vs) <- popn memory depth reg
203 foldM (flip $ push memory) reg' (roll num [] $ reverse vs) >>= int program memory
205 roll 0 acc vs = vs ++ reverse acc
206 roll n acc [] = roll n [] $ reverse acc
207 roll n acc (v:vs) = roll (n-1) (v:acc) vs
208 Pop n -> popn memory n reg >>= int program memory . fst
209 Push v -> push memory v reg >>= int program memory
210 Dup -> pop memory reg >>= \(r', v)->push memory v r' >>= push memory v >>= int program memory
211 Add -> bop (+) memory reg >>= int program memory
212 Sub -> bop (-) memory reg >>= int program memory
213 Mul -> bop (*) memory reg >>= int program memory
214 Div -> bop div memory reg >>= int program memory
215 Neg -> uop negate memory reg >>= int program memory
216 Pow -> bop (^) memory reg >>= int program memory
217 And -> bop ((b2i .) . on (&&) i2b) memory reg >>= int program memory
218 Or -> bop ((b2i .) . on (||) i2b) memory reg >>= int program memory
219 Not -> uop (b2i . Prelude.not . i2b) memory reg >>= int program memory
220 Eq -> bop ((b2i .) . (==)) memory reg >>= int program memory
221 Neq -> bop ((b2i .) . (/=)) memory reg >>= int program memory
222 Le -> bop ((b2i .) . (<)) memory reg >>= int program memory
223 Ge -> bop ((b2i .) . (>)) memory reg >>= int program memory
224 Leq -> bop ((b2i .) . (<=)) memory reg >>= int program memory
225 Geq -> bop ((b2i .) . (>=)) memory reg >>= int program memory
226 Lbl _ -> int program memory reg
227 Bra l -> branch l program reg >>= int program memory
229 (reg', v) <- pop memory reg
230 reg'' <- if i2b v then pure reg' else branch l program reg'
231 int program memory reg''
234 >>= uncurry (foldM $ flip $ pushh memory)
235 >>= push memory (hp reg + n - 1)
236 >>= int program memory
237 Ldh n -> pop memory reg >>= \(reg', hptr)->loadh memory (hptr - n - 1) reg'
238 >>= int program memory
239 Jsr i -> push memory (pc reg) reg
240 >>= push memory (mp reg)
242 >>= \r->int program memory (r { mp = sp r})
244 (reg1, rval) <- pop memory reg
245 (reg2, omp) <- pop memory reg1
246 (reg3, ra) <- pop memory reg2
247 (reg4, _) <- popn memory n reg3
248 reg5 <- push memory rval reg4
249 int program memory $ reg5 { pc=ra, mp=omp }
251 v <- readArray memory (mp reg + 3 + n)
252 push memory v reg >>= int program memory
255 branch :: Int -> STArray s Int Instr -> Registers -> ST s Registers
256 branch label program reg = case pc reg of
257 -1 -> getBounds program >>= \(_, m)->branch label program $ reg { pc = m - 1}
258 _ -> readArray program (pc reg) >>= \case
259 Lbl l | label == l -> pure $ reg
260 _ -> branch label program $ reg { pc = pc reg - 1 }