|
| 1 | +-- Copyright 2025 Google LLC |
| 2 | +-- |
| 3 | +-- Use of this source code is governed by a BSD-style |
| 4 | +-- license that can be found in the LICENSE file or at |
| 5 | +-- https://developers.google.com/open-source/licenses/bsd |
| 6 | + |
| 7 | +{-# LANGUAGE NoFieldSelectors #-} |
| 8 | + |
| 9 | +module ToLLVM where |
| 10 | + |
| 11 | +import Name |
| 12 | +import Control.Monad |
| 13 | +import Control.Monad.State.Strict hiding (state) |
| 14 | +import Data.String (fromString) |
| 15 | +import qualified Data.ByteString as BS |
| 16 | +import qualified Types.LLVM as L |
| 17 | +import Types.Simple |
| 18 | +import Types.Primitives |
| 19 | +import PPrint |
| 20 | + |
| 21 | +import Debug.Trace |
| 22 | +import QueryTypePure |
| 23 | +import Util |
| 24 | + |
| 25 | +-- === entrypoint === |
| 26 | + |
| 27 | +toLLVMEntryFun :: Monad m => L.Name -> TopLamExpr -> m L.Function |
| 28 | +toLLVMEntryFun fname fun = do |
| 29 | + finalState <- runTranslateM do |
| 30 | + toLLVMEntryFun' fun |
| 31 | + startNewBlock $ L.Name "__unused__" |
| 32 | + let blocks = reverse finalState.basicBlocks |
| 33 | + return $ L.Function fname [] blocks |
| 34 | + |
| 35 | +-- === monad for the translation === |
| 36 | + |
| 37 | +data TranslateState i = TranslateState |
| 38 | + { basicBlocks :: [L.BasicBlock] -- reverse order |
| 39 | + , instructions :: [L.Decl] -- reverse order |
| 40 | + , curBlockName :: L.Name |
| 41 | + , nameGen :: Int |
| 42 | + , subst :: TranslateSubst i} |
| 43 | +type TranslateSubst i = Subst (LiftE L.Operand) i VoidS |
| 44 | + |
| 45 | +newtype TranslateM (i::S) (a:: *) = |
| 46 | + TranslateM { inner :: State (TranslateState i) a } |
| 47 | + deriving (Functor, Applicative, Monad) |
| 48 | + |
| 49 | +runTranslateM :: Monad m => TranslateM VoidS a -> m (TranslateState VoidS) |
| 50 | +runTranslateM cont = do |
| 51 | + let initState = TranslateState [] [] (L.Name "__entry__") 0 voidSubst |
| 52 | + return $ execState cont.inner initState |
| 53 | + |
| 54 | +emitInstr :: L.Type -> L.Instruction -> TranslateM i L.Operand |
| 55 | +emitInstr resultTy instr = do |
| 56 | + v <- newLName "" |
| 57 | + let decl = (Just v, resultTy, instr) |
| 58 | + TranslateM $ modify \s -> s {instructions = decl : s.instructions} |
| 59 | + return $ L.Operand (L.LocalOcc v) resultTy |
| 60 | + |
| 61 | +emitStatement :: L.Instruction -> TranslateM i () |
| 62 | +emitStatement instr = do |
| 63 | + let decl = (Nothing, L.VoidType, instr) |
| 64 | + TranslateM $ modify \s -> s {instructions = decl : s.instructions} |
| 65 | + |
| 66 | +extendEnv :: NameBinder i i' -> L.Operand -> TranslateM i' a -> TranslateM i a |
| 67 | +extendEnv b x cont = TranslateM do |
| 68 | + prevState <- get |
| 69 | + let subst' = prevState.subst <>> (b @> LiftE x) |
| 70 | + let (ans, newState) = runState (cont.inner) $ updateSubst prevState subst' |
| 71 | + put $ updateSubst newState prevState.subst |
| 72 | + return ans |
| 73 | + |
| 74 | +lookupEnv :: Name i -> TranslateM i L.Operand |
| 75 | +lookupEnv v = TranslateM do |
| 76 | + env <- gets (.subst) |
| 77 | + let LiftE x = env ! v |
| 78 | + return x |
| 79 | + |
| 80 | +updateSubst :: TranslateState i -> TranslateSubst i' -> TranslateState i' |
| 81 | +updateSubst (TranslateState a b c d _) subst = TranslateState a b c d subst |
| 82 | + |
| 83 | +newLName :: BString -> TranslateM i L.Name |
| 84 | +newLName hint = TranslateM do |
| 85 | + c <- gets (.nameGen) |
| 86 | + modify \s -> s {nameGen = s.nameGen + 1} |
| 87 | + return $ L.Name $ hint <> "_" <> fromString (show c) |
| 88 | + |
| 89 | +startNewBlock :: L.Name -> TranslateM i () |
| 90 | +startNewBlock blockName = TranslateM $ modify \state -> do |
| 91 | + let newBlock = L.BasicBlock state.curBlockName (reverse state.instructions) |
| 92 | + state { |
| 93 | + basicBlocks = newBlock : state.basicBlocks, |
| 94 | + curBlockName = blockName, |
| 95 | + instructions = []} |
| 96 | + |
| 97 | +-- === translation itself === |
| 98 | + |
| 99 | +toLLVMEntryFun' :: TopLamExpr -> TranslateM VoidS () |
| 100 | +toLLVMEntryFun' (TopLamExpr (Abs Empty body)) = do |
| 101 | + trExpr body |
| 102 | + return () |
| 103 | + |
| 104 | +trExpr :: Expr i -> TranslateM i L.Operand |
| 105 | +trExpr = \case |
| 106 | + Block resultTy block -> trBlock block |
| 107 | + PrimOp resultTy op -> do |
| 108 | + resultTy' <- trType resultTy |
| 109 | + op' <- forM op trAtom |
| 110 | + trPrimOp resultTy' op' |
| 111 | + |
| 112 | +trType :: Type i -> TranslateM i L.Type |
| 113 | +trType = \case |
| 114 | + BaseType b -> return $ L.BaseType b |
| 115 | + ProdType [] -> return L.VoidType |
| 116 | + t -> error $ "not implemented: " ++ pprintStr t |
| 117 | + |
| 118 | +trAtom :: Atom i -> TranslateM i L.Operand |
| 119 | +trAtom = \case |
| 120 | + Var v _ -> do |
| 121 | + val <- lookupEnv v |
| 122 | + return val |
| 123 | + Lit v -> return $ L.Operand (L.Lit v) (L.BaseType (litType v)) |
| 124 | + |
| 125 | +trBlock :: Block i -> TranslateM i L.Operand |
| 126 | +trBlock (Abs decls result) = case decls of |
| 127 | + Empty -> trExpr result |
| 128 | + Nest (Let b expr) rest -> do |
| 129 | + val <- trExpr expr |
| 130 | + extendEnv b val $ trBlock $ Abs rest result |
| 131 | + |
| 132 | +trPrimOp :: L.Type -> PrimOp L.Operand -> TranslateM i L.Operand |
| 133 | +trPrimOp resultTy op = case op of |
| 134 | + BinOp b x y -> case b of |
| 135 | + FAdd -> emitInstr resultTy $ L.FAdd x y |
| 136 | + MiscOp op' -> case op' of |
| 137 | + DebugPrintInt x -> undefined |
0 commit comments