{-| Copyright : (C) 2015-2016, University of Twente, 2017-2018, Google Inc., 2021-2024, QBayLogic B.V. 2022 , Google Inc. License : BSD2 (see the file LICENSE) Maintainer : QBayLogic B.V. Generate VHDL for assorted Netlist datatypes -} {-# LANGUAGE CPP #-} {-# LANGUAGE LambdaCase #-} {-# LANGUAGE MultiWayIf #-} {-# LANGUAGE OverloadedStrings #-} {-# LANGUAGE RecursiveDo #-} {-# LANGUAGE TemplateHaskell #-} {-# LANGUAGE QuasiQuotes #-} {-# LANGUAGE TypeFamilies #-} module Clash.Backend.VHDL (VHDLState) where import Control.Arrow (second) #if !MIN_VERSION_base(4,18,0) import Control.Applicative (liftA2) #endif import Control.Lens hiding (Indexed, Empty) import Control.Monad (forM,join,zipWithM) import Control.Monad.State (State, StateT) import Data.Bifunctor (first) import Data.Bits (testBit, Bits) import qualified Data.ByteString.Char8 as B8 import Data.Coerce (coerce) import Data.Function (on) import Data.HashMap.Lazy (HashMap) import qualified Data.HashMap.Lazy as HashMap import qualified Data.HashMap.Strict as HashMapS import Data.HashSet (HashSet) import qualified Data.HashSet as HashSet import Data.List (mapAccumL, nub, nubBy, intersperse, group, sort) import Data.List.Extra ((<:>), equalLength, zipEqual) import Data.Maybe (catMaybes,mapMaybe) import Data.Monoid (Ap(Ap)) import Data.Monoid.Extra () import qualified Data.Text.Lazy as T import qualified Data.Text as TextS import Data.Text.Extra #if MIN_VERSION_prettyprinter(1,7,0) import qualified Prettyprinter as PP #else import qualified Data.Text.Prettyprint.Doc as PP #endif import Data.Text.Prettyprint.Doc.Extra import GHC.Stack (HasCallStack) import qualified System.FilePath import Text.Printf import Clash.Annotations.Primitive (HDL (..)) import Clash.Annotations.BitRepresentation.Internal (ConstrRepr'(..), DataRepr'(..)) import Clash.Annotations.BitRepresentation.ClashLib (bitsToBits) import Clash.Annotations.BitRepresentation.Util (BitOrigin(Lit, Field), bitOrigins, bitRanges) import Clash.Annotations.SynthesisAttributes (Attr(..)) import Clash.Backend import Clash.Debug (traceIf) import Clash.Driver.Types (ClashOpts(..)) import Clash.Explicit.BlockRam.Internal (unpackNats) import Clash.Netlist.BlackBox.Types (HdlSyn (..)) import Clash.Netlist.BlackBox.Util (extractLiterals, renderBlackBox, renderFilePath) import qualified Clash.Netlist.Id as Id import Clash.Netlist.Types hiding (intWidth, usages, _usages) import Clash.Netlist.Util import Clash.Util (SrcSpan, noSrcSpan, clogBase, curLoc, makeCached, indexNote) import qualified Clash.Util.Interpolate as I import Clash.Util.Graph (reverseTopSort) import Clash.Backend.Verilog (Range (..), continueWithRange) import Debug.Trace (traceM) -- | State for the 'Clash.Netlist.VHDL.VHDLM' monad: data VHDLState = VHDLState { _tyCache :: HashSet HWType -- ^ Previously encountered HWTypes , _nameCache :: (HashMap (HWType, Bool) TextS.Text) -- ^ Cache for type names. Bool indicates whether this name includes length -- information in its first "part". See `tyName'` for more information. , _modNm :: ModName , _topNm :: Identifier , _srcSpan :: SrcSpan , _libraries :: [T.Text] , _packages :: [T.Text] , _includes :: [(String,Doc)] , _dataFiles :: [(String,FilePath)] -- ^ Files to be copied: (filename, old path) , _memoryDataFiles:: [(String,String)] -- ^ Files to be stored: (filename, contents). These files are generated -- during the execution of 'genNetlist'. , _idSeen :: IdentifierSet , _tyPkgCtx :: Bool -- ^ Are we in the context of generating the @_types@ package? , _intWidth :: Int -- ^ Int/Word/Integer bit-width , _hdlsyn :: HdlSyn -- ^ For which HDL synthesis tool are we generating VHDL , _undefValue :: Maybe (Maybe Int) , _productFieldNameCache :: HashMap (Maybe [TextS.Text], [HWType]) [TextS.Text] -- ^ Caches output of 'productFieldNames'. , _enumNameCache :: HashMap HWType [TextS.Text] -- ^ Cache for enum variant names. , _aggressiveXOptBB_ :: AggressiveXOptBB , _renderEnums_ :: RenderEnums , _domainConfigurations_ :: DomainMap , _usages :: UsageMap } makeLenses ''VHDLState instance HasIdentifierSet VHDLState where identifierSet = idSeen instance HasUsageMap VHDLState where usageMap = usages instance Backend VHDLState where initBackend opts = VHDLState { _tyCache=mempty , _nameCache=mempty , _modNm="" , _topNm=Id.unsafeMake "" , _srcSpan=noSrcSpan , _libraries=[] , _packages=[] , _includes=[] , _dataFiles=[] , _memoryDataFiles=[] , _idSeen=Id.emptyIdentifierSet (opt_escapedIds opts) (opt_lowerCaseBasicIds opts) VHDL , _tyPkgCtx=False , _intWidth=opt_intWidth opts , _hdlsyn=opt_hdlSyn opts , _undefValue=opt_forceUndefined opts , _productFieldNameCache=mempty , _enumNameCache=mempty , _aggressiveXOptBB_=coerce (opt_aggressiveXOptBB opts) , _renderEnums_=coerce (opt_renderEnums opts) , _domainConfigurations_=emptyDomainMap , _usages=mempty } hdlKind = const VHDL primDirs = const $ do root <- primsRoot return [ root System.FilePath. "common" , root System.FilePath. "vhdl" ] extractTypes = _tyCache name = const "vhdl" extension = const ".vhdl" genHDL = genVHDL mkTyPackage = mkTyPackage_ hdlHWTypeKind = \case Vector {} -> pure UserType RTree {} -> pure UserType Product {} -> pure UserType MemBlob {} -> pure UserType Sum {} -> do -- If an enum is rendered, it is a user type. If not, an std_logic_vector -- is rendered, and it is a synonym. RenderEnums enums <- renderEnums if enums then pure UserType else pure SynonymType Clock {} -> pure SynonymType ClockN {} -> pure SynonymType Reset {} -> pure SynonymType Enable {} -> pure SynonymType Index {} -> pure SynonymType CustomSP {} -> pure SynonymType SP {} -> pure SynonymType -- TODO This could possibly be changed to a VHDL enum as well, provided the -- enum_encoding attribute behaves as desired in different tools CustomSum {} -> pure SynonymType CustomProduct {} -> pure SynonymType BitVector _ -> pure PrimitiveType Bool -> pure PrimitiveType Bit -> pure PrimitiveType Unsigned {} -> pure PrimitiveType Signed {} -> pure PrimitiveType String -> pure PrimitiveType Integer -> pure PrimitiveType FileType -> pure PrimitiveType -- Transparent types: BiDirectional _ ty -> hdlHWTypeKind ty Annotated _ ty -> hdlHWTypeKind ty -- Shouldn't be printed? Void {} -> pure PrimitiveType KnownDomain {} -> pure PrimitiveType hdlType Internal (filterTransparent -> ty) = sizedQualTyName ty hdlType (External nm) (filterTransparent -> ty) = let sized = sizedQualTyName ty in case ty of Bit -> sized Bool -> sized Signed _ -> sized Unsigned _ -> sized BitVector _ -> sized _ -> pretty nm <> dot <> sized hdlTypeErrValue = sizedQualTyNameErrValue hdlTypeMark = qualTyName hdlRecSel = vhdlRecSel hdlSig t ty = sigDecl (pretty t) ty genStmt = const emptyDoc inst = inst_ expr = expr_ iwWidth = use intWidth toBV t id_ = do enums <- Ap renderEnums if isBV enums t then pretty id_ else do nm <- Ap $ use modNm -- TODO: restore hack -- seen <- use seenIdentifiers -- This is a bit hacky, as id_ is just a rendered expression. -- But if it's a bare identifier that we've seen before, -- then this identifier has a defined type and we can skip the explicit type qualification. -- let e | T.toStrict id_ `HashMapS.member` seen = pretty id_ -- | otherwise = let e = hdlTypeMark t <> squote <> parens (pretty id_) pretty nm <> "_types.toSLV" <> parens e fromBV t id_ = do enums <- Ap renderEnums if isBV enums t then pretty id_ else do nm <- Ap $ use modNm qualTyName t <> "'" <> parens (pretty nm <> "_types.fromSLV" <> parens (pretty id_)) hdlSyn = use hdlsyn setModName nm s = s {_modNm = nm} setTopName nm s = s {_topNm = nm} getTopName = use topNm setSrcSpan = (srcSpan .=) getSrcSpan = use srcSpan blockDecl nm ds = do decs <- decls ds let attrs = [ (id_, attr) | NetDecl' _ id_ hwtype _ <- ds , attr <- hwTypeAttrs hwtype] if isEmpty decs then insts ds else nest 2 (pretty nm <+> colon <+> "block" <> line <> pure decs <> (if null attrs then emptyDoc else line <> line <> renderAttrs (TextS.pack "signal") attrs)) <> line <> "begin" <> nest 2 (line <> insts ds) <> line <> "end block" <> semi addIncludes inc = includes %= (inc++) addLibraries libs = libraries %= (libs ++) addImports imps = packages %= (imps ++) addAndSetData f = do fs <- use dataFiles let (fs',f') = renderFilePath fs f dataFiles .= fs' return f' getDataFiles = use dataFiles addMemoryDataFile f = memoryDataFiles %= (f:) getMemoryDataFiles = use memoryDataFiles ifThenElseExpr _ = False aggressiveXOptBB = use aggressiveXOptBB_ renderEnums = use renderEnums_ domainConfigurations = use domainConfigurations_ setDomainConfigurations confs s = s {_domainConfigurations_ = confs} type VHDLM a = Ap (State VHDLState) a -- Check if the underlying type is a BitVector isBV :: RenderEnums -> HWType -> Bool isBV e (normaliseType e -> BitVector _) = True isBV _ _ = False -- | Generate unique (partial) names for product fields. Example: -- -- > productFieldNames Nothing [Unsigned 6, Unsigned 6, Bit, Bool] -- ["unsigned6_0", "unsigned6_1", "bit", "boolean"] productFieldNames :: HasCallStack => Maybe [IdentifierText] -- ^ Label hints. From user records, for example. -> [HWType] -- ^ Field types -> VHDLM [IdentifierText] productFieldNames labels0 fields = do let labels1 = sequence labels0 ++ repeat Nothing hFields <- zipWithM hName labels1 fields let grouped = group $ sort $ hFields countGroup [] = error "productFIeldNames.countGroup: group of zero elements" countGroup (g:gs) = (g, succ (length gs)) counted = HashMapS.fromList (map countGroup grouped) names = snd $ mapAccumL (name' counted) HashMapS.empty hFields return names where hName :: Maybe IdentifierText -> HWType -> VHDLM IdentifierText hName Nothing field = tyName' False field hName (Just label) _field = Id.toText <$> Id.makeBasic label name' :: HashMap IdentifierText Int -> HashMap IdentifierText Int -> IdentifierText -> (HashMap IdentifierText Int, IdentifierText) name' counted countMap fieldName | counted HashMapS.! fieldName > 1 = -- Seen this fieldname more than once, so we need to add a number -- as a postfix: let succ' n = Just (maybe (0 :: Int) (+1) n) in let countMap' = HashMapS.alter succ' fieldName countMap in -- Each field will get a distinct number: let count = countMap' HashMapS.! fieldName in (countMap', TextS.concat [fieldName, "_", showt count]) | otherwise = -- This fieldname has only been seen once, so we don't need to add -- a number as a postfix: (countMap, fieldName) productFieldName :: HasCallStack => Maybe [IdentifierText] -- ^ Label hints. From user records, for example. -> [HWType] -- ^ Field types -> Int -- ^ Index of field -> VHDLM Doc productFieldName labels fields fieldIndex = do names <- makeCached (labels, fields) productFieldNameCache (productFieldNames labels fields) return (PP.pretty (names !! fieldIndex)) selectProductField :: HasCallStack => Maybe [IdentifierText] -- ^ Label hints. From user records, for example. -> [HWType] -- ^ Field types -> Int -- ^ Index of field -> VHDLM Doc selectProductField fieldLabels fieldTypes fieldIndex = "_sel" <> int fieldIndex <> "_" <> productFieldName fieldLabels fieldTypes fieldIndex enumVariantName :: HasCallStack => HWType -> Int -> VHDLM Doc enumVariantName ty@(Sum _ vs) i = do names <- makeCached ty enumNameCache (traverse variantName vs) pure (PP.pretty (names !! i)) where -- Make a basic identifier from the last part of a qualified name variantName = fmap Id.toText . Id.makeBasic . snd . TextS.breakOnEnd "." enumVariantName _ _ = error $ $(curLoc) ++ "enumVariantName called on non-enum type" -- | Generate VHDL for a Netlist component genVHDL :: ClashOpts -> ModName -> SrcSpan -> IdentifierSet -> UsageMap -> Component -> VHDLM ((String, Doc), [(String, Doc)]) genVHDL _ nm sp seen us c = do -- Don't have type names conflict with module names or with previously -- generated type names. -- -- TODO: Collect all type names up front, to prevent relatively costly union. -- TODO: Investigate whether type names / signal names collide in the first place Ap $ do idSeen %= Id.union seen usages .= us setSrcSpan sp v <- vhdl i <- Ap $ use includes Ap $ libraries .= [] Ap $ packages .= [] return ((TextS.unpack (Id.toText cName), v), i) where cName = componentName c vhdl = do ent <- entity c arch <- architecture c imps <- tyImports nm ("-- Automatically generated VHDL-93" <> line <> pure imps <> line <> line <> pure ent <> line <> line <> pure arch) -- | Generate a VHDL package containing type definitions for the given HWTypes mkTyPackage_ :: ModName -> [HWType] -> VHDLM [(String,Doc)] mkTyPackage_ modName (map filterTransparent -> hwtys) = do { Ap (tyPkgCtx .= True) ; syn <- Ap hdlSyn ; enums <- Ap renderEnums ; let usedTys = concatMap mkUsedTys hwtys ; let normTys0 = nub (map mkVecZ (hwtys ++ usedTys)) ; let sortedTys0 = topSortHWTys normTys0 packageDec = vcat $ mapM tyDec (nubBy eqTypM sortedTys0) (funDecs,funBodies) = unzip . mapMaybe (funDec enums syn) $ nubBy eqTypM (normaliseType enums <$> sortedTys0) ; pkg <- (:[]) <$> (TextS.unpack (modName `TextS.append` "_types"),) <$> "library IEEE;" <> line <> "use IEEE.STD_LOGIC_1164.ALL;" <> line <> "use IEEE.NUMERIC_STD.ALL;" <> line <> line <> "package" <+> pretty (modName `TextS.append` "_types") <+> "is" <> line <> indent 2 ( packageDec <> line <> vcat (sequence funDecs) ) <> line <> "end" <> semi <> packageBodyDec funBodies ; Ap (tyPkgCtx .= False) ; return pkg } where packageBodyDec :: [VHDLM Doc] -> VHDLM Doc packageBodyDec funBodies = case funBodies of [] -> emptyDoc _ -> do { line <> line <> "package" <+> "body" <+> pretty (modName `TextS.append` "_types") <+> "is" <> line <> indent 2 (vcat (sequence funBodies)) <> line <> "end" <> semi } eqTypM :: HWType -> HWType -> Bool eqTypM (Signed _) (Signed _) = True eqTypM (Unsigned _) (Unsigned _) = True eqTypM (BitVector _) (BitVector _) = True eqTypM ty1 ty2 = ty1 == ty2 mkUsedTys :: HWType -> [HWType] mkUsedTys hwty = hwty : case hwty of Vector _ elTy -> mkUsedTys elTy RTree _ elTy -> mkUsedTys elTy Product _ _ elTys -> concatMap mkUsedTys elTys SP _ elTys -> concatMap mkUsedTys (concatMap snd elTys) BiDirectional _ elTy -> mkUsedTys elTy Annotated _ elTy -> mkUsedTys elTy CustomProduct _ _ _ _ tys0 -> concatMap mkUsedTys (map snd tys0) CustomSP _ _ _ tys0 -> let tys1 = concat [tys | (_repr, _id, tys) <- tys0] in concatMap mkUsedTys tys1 _ -> [] topSortHWTys :: [HWType] -> [HWType] topSortHWTys hwtys = sorted where nodes = zip [0..] hwtys nodesI = HashMap.fromList (zip hwtys [0..]) edges = concatMap edge hwtys sorted = case reverseTopSort nodes edges of Left err -> error $ $(curLoc) ++ "[BUG IN CLASH] topSortHWTys: " ++ err Right ns -> ns -- `elTy` needs to be rendered before `t` edge t@(Vector _ elTy) = case HashMap.lookup (mkVecZ elTy) nodesI of Just node -> [(nodesI HashMap.! t, node)] Nothing -> [] -- `elTy` needs to be rendered before `t` edge t@(RTree _ elTy) = let vecZ = mkVecZ elTy in case HashMap.lookup vecZ nodesI of Just node -> [(nodesI HashMap.! t, node)] ++ edge elTy Nothing -> [] -- `tys` need to be rendered before `t` edge t@(Product _ _ tys0) = let tys1 = [HashMap.lookup (mkVecZ ty) nodesI | ty <- tys0] in map (nodesI HashMap.! t,) (catMaybes tys1) edge t@(SP _ tys0) = let tys1 = concat (map snd tys0) in let tys2 = [HashMap.lookup (mkVecZ ty) nodesI | ty <- tys1] in map (nodesI HashMap.! t,) (catMaybes tys2) edge t@(CustomSP _ _ _ tys0) = let tys1 = concat [tys | (_repr, _id, tys) <- tys0] in let tys2 = [HashMap.lookup (mkVecZ ty) nodesI | ty <- tys1] in map (nodesI HashMap.! t,) (catMaybes tys2) edge t@(CustomProduct _ _ _ _ (map snd -> tys0)) = let tys1 = [HashMap.lookup (mkVecZ ty) nodesI | ty <- tys0] in map (nodesI HashMap.! t,) (catMaybes tys1) edge _ = [] mkVecZ :: HWType -> HWType mkVecZ (Vector _ elTy) = Vector 0 elTy mkVecZ (RTree _ elTy) = RTree 0 elTy mkVecZ t = t typAliasDec :: HasCallStack => HWType -> VHDLM Doc typAliasDec hwty = do enums <- Ap renderEnums "subtype" <+> tyName hwty <+> "is" <+> sizedTyName (normaliseType enums hwty) <> semi tyDec :: HasCallStack => HWType -> VHDLM Doc tyDec hwty = do syn <- Ap hdlSyn RenderEnums enums <- Ap renderEnums case hwty of -- "Proper" custom types: Vector _ elTy -> case syn of Vivado -> "type" <+> tyName hwty <+> "is array (integer range <>) of std_logic_vector" <> parens (int (typeSize elTy - 1) <+> "downto 0") <> semi _ -> "type" <+> tyName hwty <+> "is array (integer range <>) of" <+> sizedQualTyName elTy <> semi RTree _ elTy -> case syn of Vivado -> "type" <+> tyName hwty <+> "is array (integer range <>) of" <+> "std_logic_vector" <> parens (int (typeSize elTy - 1) <+> "downto 0") <> semi _ -> "type" <+> tyName hwty <+> "is array (integer range <>) of" <+> sizedQualTyName elTy <> semi Product _ labels tys@(_:_:_) -> let selNames = map (\i -> tyName hwty <> selectProductField labels tys i) [0..] in let selTys = map sizedQualTyName tys in "type" <+> tyName hwty <+> "is record" <> line <> indent 2 (vcat $ zipWithM (\x y -> x <+> colon <+> y <> semi) selNames selTys) <> line <> "end record" <> semi Sum _ vs | enums -> let variantNames = traverse (enumVariantName hwty) [0..length vs - 1] in "type" <+> tyName hwty <+> "is" <+> parens (hsep (punctuate comma variantNames)) <> semi MemBlob n m -> tyDec (Vector n (BitVector m)) -- Type aliases: Clock _ -> typAliasDec hwty ClockN _ -> typAliasDec hwty Reset _ -> typAliasDec hwty Enable _ -> typAliasDec hwty Index _ -> typAliasDec hwty CustomSP _ _ _ _ -> typAliasDec hwty Sum _ _ -> typAliasDec hwty SP _ _ -> typAliasDec hwty CustomSum _ _ _ _ -> typAliasDec hwty CustomProduct {} -> typAliasDec hwty -- VHDL builtin types: BitVector _ -> emptyDoc Bool -> emptyDoc Bit -> emptyDoc Unsigned _ -> emptyDoc Signed _ -> emptyDoc String -> emptyDoc Integer -> emptyDoc FileType -> emptyDoc -- Transparent types: BiDirectional _ ty -> tyDec ty Annotated _ ty -> tyDec ty Void {} -> emptyDoc KnownDomain {} -> emptyDoc -- Unexpected arguments: Product _ _ _ -> error $ $(curLoc) ++ [I.i| Unexpected Product with fewer than 2 fields: #{hwty} |] funDec :: RenderEnums -> HdlSyn -> HWType -> Maybe (VHDLM Doc,VHDLM Doc) funDec _ _ Bool = Just ( "function" <+> "toSLV" <+> parens ("b" <+> colon <+> "in" <+> "boolean") <+> "return" <+> "std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("sl" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "boolean" <> semi <> line <> "function" <+> "tagToEnum" <+> parens ("s" <+> colon <+> "in" <+> "signed") <+> "return" <+> "boolean" <> semi <> line <> "function" <+> "dataToTag" <+> parens ("b" <+> colon <+> "in" <+> "boolean") <+> "return" <+> "signed" <> semi , "function" <+> "toSLV" <+> parens ("b" <+> colon <+> "in" <+> "boolean") <+> "return" <+> "std_logic_vector" <+> "is" <> line <> "begin" <> line <> indent 2 (vcat $ sequence ["if" <+> "b" <+> "then" , indent 2 ("return" <+> dquotes (int 1) <> semi) ,"else" , indent 2 ("return" <+> dquotes (int 0) <> semi) ,"end" <+> "if" <> semi ]) <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("sl" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "boolean" <+> "is" <> line <> "begin" <> line <> indent 2 (vcat $ sequence ["if" <+> "sl" <+> "=" <+> dquotes (int 1) <+> "then" , indent 2 ("return" <+> "true" <> semi) ,"else" , indent 2 ("return" <+> "false" <> semi) ,"end" <+> "if" <> semi ]) <> line <> "end" <> semi <> line <> "function" <+> "tagToEnum" <+> parens ("s" <+> colon <+> "in" <+> "signed") <+> "return" <+> "boolean" <+> "is" <> line <> "begin" <> line <> indent 2 (vcat $ sequence ["if" <+> "s" <+> "=" <+> "to_signed" <> parens (int 0 <> comma <> (Ap (use intWidth) >>= int)) <+> "then" , indent 2 ("return" <+> "false" <> semi) ,"else" , indent 2 ("return" <+> "true" <> semi) ,"end" <+> "if" <> semi ]) <> line <> "end" <> semi <> line <> "function" <+> "dataToTag" <+> parens ("b" <+> colon <+> "in" <+> "boolean") <+> "return" <+> "signed" <+> "is" <> line <> "begin" <> line <> indent 2 (vcat $ sequence ["if" <+> "b" <+> "then" , indent 2 ("return" <+> "to_signed" <> parens (int 1 <> comma <> (Ap (use intWidth) >>= int)) <> semi) ,"else" , indent 2 ("return" <+> "to_signed" <> parens (int 0 <> comma <> (Ap (use intWidth) >>= int)) <> semi) ,"end" <+> "if" <> semi ]) <> line <> "end" <> semi ) funDec _ _ bit@Bit = Just ( "function" <+> "toSLV" <+> parens ("sl" <+> colon <+> "in" <+> tyName bit) <+> "return" <+> "std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> tyName bit <> semi , "function" <+> "toSLV" <+> parens ("sl" <+> colon <+> "in" <+> tyName bit) <+> "return" <+> "std_logic_vector" <+> "is" <> line <> "begin" <> line <> indent 2 ("return" <+> "std_logic_vector'" <> parens (int 0 <+> rarrow <+> "sl") <> semi) <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> tyName bit <+> "is" <> line <> indent 2 ( "alias islv : std_logic_vector (0 to slv'length - 1) is slv;" ) <> line <> "begin" <> line <> indent 2 ("return" <+> "islv" <> parens (int 0) <> semi) <> line <> "end" <> semi ) funDec _ _ (Signed _) = Just ( "function" <+> "toSLV" <+> parens ("s" <+> colon <+> "in" <+> "signed") <+> "return" <+> "std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "signed" <> semi , "function" <+> "toSLV" <+> parens ("s" <+> colon <+> "in" <+> "signed") <+> "return" <+> "std_logic_vector" <+> "is" <> line <> "begin" <> line <> indent 2 ("return" <+> "std_logic_vector" <> parens ("s") <> semi) <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "signed" <+> "is" <> line <> indent 2 ("alias islv : std_logic_vector(0 to slv'length - 1) is slv;") <> line <> "begin" <> line <> indent 2 ("return" <+> "signed" <> parens ("islv") <> semi) <> line <> "end" <> semi ) funDec _ _ (Unsigned _) = Just ( "function" <+> "toSLV" <+> parens ("u" <+> colon <+> "in" <+> "unsigned") <+> "return" <+> "std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "unsigned" <> semi , "function" <+> "toSLV" <+> parens ("u" <+> colon <+> "in" <+> "unsigned") <+> "return" <+> "std_logic_vector" <+> "is" <> line <> "begin" <> line <> indent 2 ("return" <+> "std_logic_vector" <> parens ("u") <> semi) <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "unsigned" <+> "is" <> line <> indent 2 "alias islv : std_logic_vector(0 to slv'length - 1) is slv;" <> line <> "begin" <> line <> indent 2 ("return" <+> "unsigned" <> parens ("islv") <> semi) <> line <> "end" <> semi ) funDec _ _ t@(Product _ labels elTys) = Just ( "function" <+> "toSLV" <+> parens ("p :" <+> sizedTyName t) <+> "return std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> sizedTyName t <> semi , "function" <+> "toSLV" <+> parens ("p :" <+> sizedTyName t) <+> "return std_logic_vector" <+> "is" <> line <> "begin" <> line <> indent 2 ("return" <+> parens (hcat (punctuate " & " elTyToSLV)) <> semi) <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> sizedTyName t <+> "is" <> line <> "alias islv : std_logic_vector(0 to slv'length - 1) is slv;" <> line <> "begin" <> line <> indent 2 ("return" <+> parens (hcat (punctuate "," elTyFromSLV)) <> semi) <> line <> "end" <> semi ) where elTyToSLV = forM [0..(length elTys - 1)] (\i -> "toSLV" <> parens ("p." <> tyName t <> selectProductField labels elTys i)) argLengths = map typeSize elTys starts1 = snd (mapAccumL ((join (,) .) . (+)) 0 argLengths) starts = 0 : starts1 ends = map (subtract 1) starts1 elTyFromSLV = forM (zip starts ends) (\(s,e) -> "fromSLV" <> parens ("islv" <> parens (int s <+> "to" <+> int e))) funDec (RenderEnums enums) _ t@(Sum _ _) | enums = Just ( "function" <+> "toSLV" <+> parens("value" <+> colon <+> "in" <+> qualTyName t) <+> "return std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> qualTyName t <> semi , "function" <+> "toSLV" <+> parens ("value" <+> colon <+> "in" <+> qualTyName t) <+> "return std_logic_vector" <+> "is" <> line <> "begin" <> line <> indent 2 ( "return" <+> "std_logic_vector" <> parens ("to_unsigned" <> parens (qualTyName t <> "'pos(value)" <> comma <+> int (typeSize t)) )) <> semi <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> qualTyName t <+> "is" <> line <> "begin" <> line <> indent 2 ( translate_off ( "if unsigned(slv) <= " <> qualTyName t <> "'pos("<> qualTyName t <> "'high) then" ) <> line <> indent 2 ( "return" <+> qualTyName t <> "'val" <> parens ("to_integer" <> parens ("unsigned" <> parens "slv"))) <> semi <> line <> translate_off ( "else" <> line <> indent 2 ( "return" <+> qualTyName t <> "'val(0)") <> semi <> line <> "end if" <> semi ) ) <> line <> "end" <> semi ) where translate_off body = "-- pragma translate_off" <> line <> body <> line <> "-- pragma translate_on" funDec _ syn t@(Vector _ elTy) = Just ( "function" <+> "toSLV" <+> parens ("value : " <+> qualTyName t) <+> "return std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> qualTyName t <> semi , "function" <+> "toSLV" <+> parens ("value : " <+> qualTyName t) <+> "return std_logic_vector" <+> "is" <> line <> indent 2 ( "alias ivalue :" <+> qualTyName t <> "(1 to value'length) is value;" <> line <> "variable result :" <+> "std_logic_vector" <> parens ("1 to value'length * " <> int (typeSize elTy)) <> semi ) <> line <> "begin" <> line <> indent 2 ("for i in ivalue'range loop" <> line <> indent 2 ( "result" <> parens (parens ("(i - 1) * " <> int (typeSize elTy)) <+> "+ 1" <+> "to i*" <> int (typeSize elTy)) <+> ":=" <+> (case syn of Vivado -> "ivalue" <> parens ("i") _ -> "toSLV" <> parens ("ivalue" <> parens ("i"))) <> semi ) <> line <> "end" <+> "loop" <> semi <> line <> "return" <+> "result" <> semi ) <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> qualTyName t <+> "is" <> line <> indent 2 ( "alias islv :" <+> "std_logic_vector" <> "(0 to slv'length - 1) is slv;" <> line <> "variable result :" <+> qualTyName t <> parens ("0 to slv'length / " <> eSz <+> "- 1") <> semi ) <> line <> "begin" <> line <> indent 2 ("for i in result'range loop" <> line <> indent 2 ( "result" <> parens "i" <+> ":=" <+> case syn of Vivado -> getElem <> semi _ | BitVector _ <- elTy -> getElem <> semi | otherwise -> "fromSLV" <> parens getElem <> semi ) <> line <> "end" <+> "loop" <> semi <> line <> "return" <+> "result" <> semi ) <> line <> "end" <> semi ) where eSz = int (typeSize elTy) getElem = "islv" <> parens ("i * " <> eSz <+> "to (i+1) * " <> eSz <+> "- 1") funDec _ _ (BitVector _) = Just ( "function" <+> "toSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "std_logic_vector" <> semi , "function" <+> "toSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "std_logic_vector" <+> "is" <> line <> "begin" <> line <> indent 2 ("return" <+> "slv" <> semi) <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> "std_logic_vector" <+> "is" <> line <> "begin" <> line <> indent 2 ("return" <+> "slv" <> semi) <> line <> "end" <> semi ) funDec _ syn t@(RTree _ elTy) = Just ( "function" <+> "toSLV" <+> parens ("value : " <+> qualTyName t) <+> "return std_logic_vector" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> qualTyName t <> semi , "function" <+> "toSLV" <+> parens ("value : " <+> qualTyName t) <+> "return std_logic_vector" <+> "is" <> line <> indent 2 ( "alias ivalue :" <+> qualTyName t <> "(1 to value'length) is value;" <> line <> "variable result :" <+> "std_logic_vector" <> parens ("1 to value'length * " <> int (typeSize elTy)) <> semi ) <> line <> "begin" <> line <> indent 2 ("for i in ivalue'range loop" <> line <> indent 2 ( "result" <> parens (parens ("(i - 1) * " <> int (typeSize elTy)) <+> "+ 1" <+> "to i*" <> int (typeSize elTy)) <+> ":=" <+> (case syn of Vivado -> "ivalue" <> parens ("i") _ -> "toSLV" <> parens ("ivalue" <> parens ("i"))) <> semi ) <> line <> "end" <+> "loop" <> semi <> line <> "return" <+> "result" <> semi ) <> line <> "end" <> semi <> line <> "function" <+> "fromSLV" <+> parens ("slv" <+> colon <+> "in" <+> "std_logic_vector") <+> "return" <+> qualTyName t <+> "is" <> line <> indent 2 ( "alias islv :" <+> "std_logic_vector" <> "(0 to slv'length - 1) is slv;" <> line <> "variable result :" <+> qualTyName t <> parens ("0 to slv'length / " <> eSz <+> "- 1") <> semi ) <> line <> "begin" <> line <> indent 2 ("for i in result'range loop" <> line <> indent 2 ( "result" <> parens "i" <+> ":=" <+> case syn of Vivado -> getElem <> semi _ | BitVector _ <- elTy -> getElem <> semi | otherwise -> "fromSLV" <> parens getElem <> semi ) <> line <> "end" <+> "loop" <> semi <> line <> "return" <+> "result" <> semi ) <> line <> "end" <> semi ) where eSz = int (typeSize elTy) getElem = "islv" <> parens ("i * " <> eSz <+> "to (i+1) * " <> eSz <+> "- 1") funDec _ _ _ = Nothing tyImports :: ModName -> VHDLM Doc tyImports nm = do libs <- Ap $ use libraries packs <- Ap $ use packages punctuate' semi $ sequence ([ "library IEEE" , "use IEEE.STD_LOGIC_1164.ALL" , "use IEEE.NUMERIC_STD.ALL" , "use IEEE.MATH_REAL.ALL" , "use std.textio.all" , "use work.all" , "use work." <> pretty (nm `TextS.append` "_types") <> ".all" ] ++ (map (("library" <+>) . pretty) (nub libs)) ++ (map (("use" <+>) . pretty) (nub packs))) -- TODO: Way too much happening on a single line port :: Num t => Identifier -> HWType -> VHDLM Doc -> Int -> Maybe Expr -> VHDLM (Doc, t) port (Id.toText -> elName) hwType portDirection fillToN iEM = (,fromIntegral $ TextS.length elName) <$> (encodingNote hwType <> fill fillToN (pretty elName) <+> colon <+> direction <+> sizedQualTyName hwType <> iE) where direction | isBiSignalIn hwType = "inout" | otherwise = portDirection iE = maybe emptyDoc (noEmptyInit . expr_ False) iEM -- [Note] Hack entity attributes in architecture -- -- By default we print attributes inside the entity block. This conforms -- to the VHDL standard (IEEE Std 1076-1993, 5.1 Attribute specification, -- paragraph 9), and is subsequently implemented in this way by open-source -- simulators such as GHDL. --- -- Intel and Xilinx use their own annotation schemes unfortunately, which -- require attributes in the architecture. -- -- References: -- * https://www.mail-archive.com/ghdl-discuss@gna.org/msg03175.html -- * https://forums.xilinx.com/t5/Simulation-and-Verification/wrong-attribute-decorations-of-port-signals-generated-by-write/m-p/704905#M16265 -- * http://quartushelp.altera.com/15.0/mergedProjects/hdl/vhdl/vhdl_file_dir_chip.htm entity :: Component -> VHDLM Doc entity c = do syn <- Ap hdlSyn rec (p,ls) <- fmap unzip (ports (maximum ls)) "entity" <+> pretty (componentName c) <+> "is" <> line <> (case p of [] -> emptyDoc _ -> case syn of -- See: [Note] Hack entity attributes in architecture Other -> indent 2 (rports p <> if null attrs then emptyDoc else line <> line <> rattrs) <> line <> "end" <> semi _ -> indent 2 (rports p) <> line <> "end" <> semi ) where ports l = sequence $ [port iName hwType "in" l Nothing | (iName, hwType) <- inputs c] ++ [port oName hwType "out" l iEM | (_, (oName, hwType), iEM) <- outputs c] rports p = "port" <> (parens (align (vcat (punctuate semi (pure p))))) <> semi rattrs = renderAttrs (TextS.pack "signal") attrs attrs = inputAttrs ++ outputAttrs inputAttrs = [(id_, attr) | (id_, hwtype) <- inputs c, attr <- hwTypeAttrs hwtype] outputAttrs = [(id_, attr) | (_, (id_, hwtype), _) <- outputs c, attr <- hwTypeAttrs hwtype] architecture :: Component -> VHDLM Doc architecture c = do { ; syn <- Ap hdlSyn ; let attrs = case syn of -- See: [Note] Hack entity attributes in architecture Other -> declAttrs _ -> inputAttrs ++ outputAttrs ++ declAttrs ; nest 2 (("architecture structural of" <+> pretty (componentName c) <+> "is" <> line <> decls (declarations c)) <> line <> if null attrs then emptyDoc else line <> line <> renderAttrs (TextS.pack "signal") attrs) <> line <> nest 2 ("begin" <> line <> insts (declarations c)) <> line <> "end" <> semi } where netdecls = filter isNetDecl (declarations c) declAttrs = [(id_, attr) | NetDecl' _ id_ hwtype _ <- netdecls, attr <- hwTypeAttrs hwtype] inputAttrs = [(id_, attr) | (id_, hwtype) <- inputs c, attr <- hwTypeAttrs hwtype] outputAttrs = [(id_, attr) | (_, (id_, hwtype), _) <- outputs c, attr <- hwTypeAttrs hwtype] isNetDecl :: Declaration -> Bool isNetDecl NetDecl'{} = True isNetDecl _ = False attrType :: HashMap TextS.Text TextS.Text -> Attr TextS.Text -> HashMap TextS.Text TextS.Text attrType types attr = case HashMap.lookup name' types of Nothing -> HashMap.insert name' type' types Just type'' | type'' == type' -> types | otherwise -> error $ $(curLoc) ++ unwords [ TextS.unpack name', "already assigned" , TextS.unpack type'', "while we tried to" , "add", TextS.unpack type' ] where name' = attrName attr type' = case attr of BoolAttr _ _ -> "boolean" IntegerAttr _ _ -> "integer" StringAttr _ _ -> "string" Attr _ -> "boolean" attrName :: Attr a -> a attrName = \case BoolAttr a _ -> a IntegerAttr a _ -> a StringAttr a _ -> a Attr a -> a -- | Create 'attrname -> type' mapping for given attributes. Will err if multiple -- types are assigned to the same name. attrTypes :: [Attr TextS.Text] -> HashMap TextS.Text TextS.Text attrTypes = foldl attrType HashMap.empty -- | Create a 'attrname -> (type, [(signalname, value)]). Will err if multiple -- types are assigned to the same name. attrMap :: forall t . t ~ HashMap TextS.Text (TextS.Text, [(TextS.Text, TextS.Text)]) => [(Identifier, Attr TextS.Text)] -> t attrMap attrs0 = foldl go empty' attrs1 where attrs1 = map (first Id.toText) attrs0 empty' = HashMap.fromList [(k, (types HashMap.! k, [])) | k <- HashMap.keys types] types = attrTypes (map snd attrs1) go :: t -> (TextS.Text, Attr TextS.Text) -> t go map' attr = HashMap.adjust (go' attr) (attrName $ snd attr) map' go' :: (TextS.Text, Attr TextS.Text) -> (TextS.Text, [(TextS.Text, TextS.Text)]) -> (TextS.Text, [(TextS.Text, TextS.Text)]) go' (signalName, attr) (typ, elems) = (typ, (signalName, renderAttr attr) : elems) renderAttrs :: TextS.Text -> [(Identifier, Attr TextS.Text)] -> VHDLM Doc renderAttrs what (attrMap -> attrs) = vcat $ sequence $ intersperse " " $ map renderAttrGroup (HashMap.toList attrs) where renderAttrGroup :: (TextS.Text, (TextS.Text, [(TextS.Text, TextS.Text)])) -> VHDLM Doc renderAttrGroup (attrname, (typ, elems)) = ("attribute" <+> stringS attrname <+> colon <+> stringS typ <> semi) <> line <> (vcat $ sequence $ map (renderAttrDecl attrname) elems) renderAttrDecl :: TextS.Text -> (TextS.Text, TextS.Text) -> VHDLM Doc renderAttrDecl attrname (signalName, value) = "attribute" <+> stringS attrname <+> "of" <+> stringS signalName -- or component name <+> colon <+> stringS what <+> "is" -- "signal is" or "component is" <+> stringS value <> semi -- | Convert single attribute to VHDL syntax renderAttr :: Attr TextS.Text -> TextS.Text renderAttr (StringAttr _key value) = wrap '"' $ TextS.replace "\"" "\"\"" value renderAttr (IntegerAttr _key value) = TextS.pack (show value) renderAttr (BoolAttr _key True ) = "true" renderAttr (BoolAttr _key False) = "false" renderAttr (Attr _key ) = "true" -- | Prepend and append a character to a string wrap :: Char -> TextS.Text -> TextS.Text wrap c = cons c . (`snoc` c) sigDecl :: VHDLM Doc -> HWType -> VHDLM Doc sigDecl d t = d <+> colon <+> sizedQualTyName t -- | Append size information to given type string appendSize :: VHDLM Doc -> HWType -> VHDLM Doc appendSize baseType sizedType = case sizedType of BitVector n -> baseType <> parens (int (n-1) <+> "downto 0") Signed n -> baseType <> parens (int (n-1) <+> "downto 0") Unsigned n -> baseType <> parens (int (n-1) <+> "downto 0") Vector n _ -> baseType <> parens ("0 to" <+> int (n-1)) RTree d _ -> baseType <> parens ("0 to" <+> int ((2^d)-1)) MemBlob n _ -> baseType <> parens ("0 to" <+> int (n-1)) Annotated _ elTy -> appendSize baseType elTy _ -> baseType -- | Same as @qualTyName@, but instantiate generic types with their size. sizedQualTyName :: HWType -> VHDLM Doc sizedQualTyName (filterTransparent -> hwty) = appendSize (qualTyName hwty) hwty -- | Same as @tyName@, but instantiate generic types with their size. sizedTyName :: HWType -> VHDLM Doc sizedTyName (filterTransparent -> hwty) = appendSize (tyName hwty) hwty -- | Same as @tyName@, but return fully qualified name (name, including module) qualTyName :: HWType -> VHDLM Doc qualTyName (filterTransparent -> hwty) = case hwty of -- Builtin types: Bit -> tyName hwty Bool -> tyName hwty Signed _ -> tyName hwty Unsigned _ -> tyName hwty BitVector _ -> tyName hwty -- Transparent types: BiDirectional _ elTy -> qualTyName elTy Annotated _ elTy -> qualTyName elTy -- Custom types: _ -> do pkgCtx <- Ap (use tyPkgCtx) modName <- Ap (use modNm) if pkgCtx then tyName hwty else pretty modName <> "_types." <> tyName hwty -- | Generates a unique name for a given type. This action will cache its -- results, thus returning the same answer for the same @HWType@ argument. -- Some type names do not have specific names, but are instead basic types -- in VHDL. tyName :: HWType -- ^ Type to name -> VHDLM Doc tyName t = do nm <- tyName' False t pretty nm -- | Generates a unique name for a given type. This action will cache its -- results, thus returning the same answer for the same @HWType@ argument. -- Some type names do not have specific names, but are instead basic types -- in VHDL. tyName' :: HasCallStack => Bool -- ^ Include length information in first part of name. For example, say we -- want to generate a name for a vector, where the vector is of length -- 5, and signed has 64 bits. When given `True`, this function would -- generate `array_of_5_signed_64`. When given `False` it would generate -- `array_of_signed_64`. Note that parts other than the first part will always -- have length information. This option is useful for generating names in -- VHDL, where the `False` case is needed to create generic types. -> HWType -- ^ Type to name -> VHDLM TextS.Text tyName' rec0 (filterTransparent -> t) = do Ap (tyCache %= HashSet.insert t) case t of KnownDomain {} -> return (error ($(curLoc) ++ "Forced to print KnownDomain tyName")) Void _ -> return (error ($(curLoc) ++ "Forced to print Void tyName: " ++ show t)) Bool -> return "boolean" Signed n -> let app = if rec0 then ["_", showt n] else [] in return $ TextS.concat $ "signed" : app Unsigned n -> let app = if rec0 then ["_", showt n] else [] in return $ TextS.concat $ "unsigned" : app BitVector n -> let app = if rec0 then ["_", showt n] else [] in return $ TextS.concat $ "std_logic_vector" : app String -> return "string" Integer -> return "integer" Bit -> return "std_logic" Vector n elTy -> do elTy' <- tyName' True elTy let nm = TextS.concat [ "array_of_" , if rec0 then showt n `TextS.append` "_" else "" , elTy'] Ap $ makeCached (t, rec0) nameCache (return nm) RTree n elTy -> do elTy' <- tyName' True elTy let nm = TextS.concat [ "tree_of_" , if rec0 then showt n `TextS.append` "_" else "" , elTy'] Ap $ makeCached (t, rec0) nameCache (return nm) -- TODO: nice formatting for Index. I.e., 2000 = 2e3, 1024 = 2pow10 Index n -> return ("index_" `TextS.append` showt n) Clock nm0 -> let nm1 = "clk_" `TextS.append` nm0 in Ap $ makeCached (t, False) nameCache (userTyName "clk" nm1 t) ClockN nm0 -> let nm1 = "clk_n_" `TextS.append` nm0 in Ap $ makeCached (t, False) nameCache (userTyName "clk" nm1 t) Reset nm0 -> let nm1 = "rst_" `TextS.append` nm0 in Ap $ makeCached (t, False) nameCache (userTyName "rst" nm1 t) Enable nm0 -> let nm1 = "en_" `TextS.append` nm0 in Ap $ makeCached (t, False) nameCache (userTyName "en" nm1 t) Sum nm _ -> Ap $ makeCached (t, False) nameCache (userTyName "sum" nm t) CustomSum nm _ _ _ -> Ap $ makeCached (t, False) nameCache (userTyName "sum" nm t) SP nm _ -> Ap $ makeCached (t, False) nameCache (userTyName "sp" nm t) CustomSP nm _ _ _ -> Ap $ makeCached (t, False) nameCache (userTyName "sp" nm t) Product nm _ _ -> Ap $ makeCached (t, False) nameCache (userTyName "product" nm t) CustomProduct nm _ _ _ _ -> Ap $ makeCached (t, False) nameCache (userTyName "product" nm t) Annotated _ hwTy -> tyName' rec0 hwTy BiDirectional _ hwTy -> tyName' rec0 hwTy FileType -> return "file" ty -> return (error ($(curLoc) ++ show ty ++ " not filtered by filterTransparent")) -- | Returns underlying type of given HWType. That is, the type by which it -- eventually will be represented in VHDL. normaliseType :: RenderEnums -> HWType -> HWType normaliseType enums@(RenderEnums e) hwty = case hwty of Void {} -> hwty KnownDomain {} -> hwty -- Base types: Bool -> hwty Signed _ -> hwty Unsigned _ -> hwty BitVector _ -> hwty String -> hwty Integer -> hwty Bit -> hwty FileType -> hwty -- Complex types, for which a user defined type is made in VHDL: Vector _ _ -> hwty RTree _ _ -> hwty Product _ _ _ -> hwty Sum _ _ -> if e then hwty else BitVector (typeSize hwty) MemBlob n m -> Vector n (BitVector m) -- Simple types, for which a subtype (without qualifiers) will be made in VHDL: Clock _ -> Bit ClockN _ -> Bit Reset _ -> Bit Enable _ -> Bool Index _ -> Unsigned (typeSize hwty) CustomSP _ _ _ _ -> BitVector (typeSize hwty) SP _ _ -> BitVector (typeSize hwty) CustomSum _ _ _ _ -> BitVector (typeSize hwty) CustomProduct {} -> BitVector (typeSize hwty) -- Transparent types: Annotated _ elTy -> normaliseType enums elTy BiDirectional _ elTy -> normaliseType enums elTy -- | Recursively remove transparent types from given type filterTransparent :: HWType -> HWType filterTransparent hwty = case hwty of Bool -> hwty Signed _ -> hwty Unsigned _ -> hwty BitVector _ -> hwty String -> hwty Integer -> hwty Bit -> hwty Clock _ -> hwty ClockN _ -> hwty Reset _ -> hwty Enable _ -> hwty Index _ -> hwty Sum _ _ -> hwty CustomSum _ _ _ _ -> hwty FileType -> hwty MemBlob n m -> Vector n (BitVector m) Vector n elTy -> Vector n (filterTransparent elTy) RTree n elTy -> RTree n (filterTransparent elTy) Product nm labels elTys -> Product nm labels (map filterTransparent elTys) SP nm0 constrs -> SP nm0 (map (\(nm1, tys) -> (nm1, map filterTransparent tys)) constrs) CustomSP nm0 drepr size constrs -> CustomSP nm0 drepr size (map (\(repr, nm1, tys) -> (repr, nm1, map filterTransparent tys)) constrs) CustomProduct nm0 drepr size maybeFieldNames constrs -> CustomProduct nm0 drepr size maybeFieldNames (map (second filterTransparent) constrs) -- Transparent types: Annotated _ elTy -> filterTransparent elTy BiDirectional _ elTy -> filterTransparent elTy Void {} -> hwty KnownDomain {} -> hwty -- | Create a unique type name for user defined types userTyName :: IdentifierText -- ^ Default name -> IdentifierText -- ^ Identifier stored in @hwTy@ -> HWType -- ^ Type to give a (unique) name -> StateT VHDLState Identity IdentifierText userTyName dflt nm0 hwTy = do tyCache %= HashSet.insert hwTy Id.toText <$> Id.makeBasicOr (last (TextS.splitOn "." nm0)) dflt -- | Convert a Netlist HWType to an error VHDL value for that type sizedQualTyNameErrValue :: HWType -> VHDLM Doc sizedQualTyNameErrValue Bool = do udf <- Ap (use undefValue) case udf of Just (Just 0) -> "false" _ -> "true" sizedQualTyNameErrValue Bit = singularErrValue sizedQualTyNameErrValue t@(Vector n elTy) = do syn <-Ap hdlSyn case syn of Vivado -> qualTyName t <> "'" <> parens (int 0 <+> "to" <+> int (n-1) <+> rarrow <+> "std_logic_vector'" <> parens (int 0 <+> "to" <+> int (typeSize elTy - 1) <+> rarrow <+> singularErrValue)) _ -> qualTyName t <> "'" <> parens (int 0 <+> "to" <+> int (n-1) <+> rarrow <+> sizedQualTyNameErrValue elTy) sizedQualTyNameErrValue t@(RTree n elTy) = do syn <-Ap hdlSyn case syn of Vivado -> qualTyName t <> "'" <> parens (int 0 <+> "to" <+> int (2^n - 1) <+> rarrow <+> "std_logic_vector'" <> parens (int 0 <+> "to" <+> int (typeSize elTy - 1) <+> rarrow <+> singularErrValue)) _ -> qualTyName t <> "'" <> parens (int 0 <+> "to" <+> int (2^n - 1) <+> rarrow <+> sizedQualTyNameErrValue elTy) sizedQualTyNameErrValue t@(Product _ _ elTys) = qualTyName t <> "'" <> tupled (mapM sizedQualTyNameErrValue elTys) sizedQualTyNameErrValue t@(Sum _ _) = do -- No undefined / don't care for enums, so just set it to the first value RenderEnums enums <- Ap renderEnums if enums then tyName t <> "'val" <> parens (int 0) else qualTyName t <> "'" <> parens (int 0 <+> "to" <+> int (typeSize t - 1) <+> rarrow <+> singularErrValue) sizedQualTyNameErrValue (Clock _) = singularErrValue sizedQualTyNameErrValue (ClockN _) = singularErrValue sizedQualTyNameErrValue (Reset _) = singularErrValue sizedQualTyNameErrValue (Enable _) = singularErrValue sizedQualTyNameErrValue (Void {}) = return (error ($(curLoc) ++ "[CLASH BUG] Forced to print Void error value")) sizedQualTyNameErrValue String = "\"ERROR\"" sizedQualTyNameErrValue t = qualTyName t <> "'" <> parens (int 0 <+> "to" <+> int (typeSize t - 1) <+> rarrow <+> singularErrValue) singularErrValue :: VHDLM Doc singularErrValue = do udf <- Ap (use undefValue) case udf of Nothing -> "'-'" Just Nothing -> "'0'" Just (Just x) -> "'" <> int x <> "'" vhdlRecSel :: HWType -> Int -> VHDLM Doc vhdlRecSel p@(Product _ labels tys) i = tyName p <> selectProductField labels tys i vhdlRecSel ty i = tyName ty <> "_sel" <> int i decls :: [Declaration] -> VHDLM Doc decls [] = emptyDoc decls ds = do rec (dsDoc,ls) <- fmap (unzip . catMaybes) $ mapM (decl (maximum ls)) ds case dsDoc of [] -> emptyDoc _ -> vcat (pure dsDoc) decl :: Int -> Declaration -> VHDLM (Maybe (Doc,Int)) decl l (NetDecl' noteM id_ ty iEM) = Just <$> (,fromIntegral (TextS.length (Id.toText id_))) <$> maybe id addNote noteM ("signal" <+> fill l (pretty id_) <+> colon <+> sizedQualTyName ty <> iE <> semi) where addNote n = mappend ("--" <+> pretty n <> line) iE = maybe emptyDoc (noEmptyInit . expr_ False) iEM decl _ (InstDecl Comp _ attrs nm _ gens (NamedPortMap pms)) = fmap (Just . (,0)) $ do { rec (p,ls) <- fmap unzip $ sequence [ (,formalLength i) <$> fill (maximum ls) (expr_ False i) <+> colon <+> portDir dir <+> sizedQualTyName ty | (i,dir,ty,_) <- pms ] ; rec (g,lsg) <- fmap unzip $ sequence [ (,formalLength i) <$> fill (maximum lsg) (expr_ False i) <+> colon <+> tyName ty | (i,ty,_) <- gens] ; "component" <+> pretty nm <> line <> ( if null g then emptyDoc else indent 2 ("generic" <> line <> tupledSemi (pure g) <> semi) <> line ) <> indent 2 ("port" <+> tupledSemi (pure p) <> semi) <> line <> "end component" <> semi <> line <> attrs' } where formalLength (Identifier i _) = fromIntegral (TextS.length (Id.toText i)) formalLength _ = 0 portDir In = "in" portDir Out = "out" attrs' | null attrs = emptyDoc | otherwise = renderAttrs (TextS.pack "component") [(nm, a) | a <- attrs] decl _ (CompDecl nm ps0) = fmap (Just . (,0)) $ "component" <+> pretty nm <+> ("port" <> line <> indent 2 (tupledSemi ps <> semi)) <> line <> "end component" <> semi where ps = traverse (\(t,pd,ty) -> pretty t <+> ":" <+> ppd pd <+> sizedQualTyName ty) ps0 ppd = \case { In -> "in"; Out -> "out"} decl _ _ = return Nothing noEmptyInit :: VHDLM Doc -> VHDLM Doc noEmptyInit d = do d1 <- d if isEmpty d1 then emptyDoc else (space <> ":=" <+> d) stdMatch :: Bits a => Int -> a -> a -> String stdMatch 0 _mask _value = [] stdMatch size mask value = symbol : stdMatch (size - 1) mask value where symbol = if testBit mask (size - 1) then if testBit value (size - 1) then '1' else '0' else '-' patLitCustom' :: Bits a => VHDLM Doc -> Int -> a -> a -> VHDLM Doc patLitCustom' var size mask value = let mask' = string $ T.pack $ stdMatch size mask value in "std_match" <> parens (dquotes mask' <> comma <+> var) patLitCustom :: VHDLM Doc -> HWType -> Literal -> VHDLM Doc patLitCustom var (CustomSum _name _dataRepr size reprs) (NumLit (fromIntegral -> i)) = patLitCustom' var size mask value where ((ConstrRepr' _name _n mask value _anns), _id) = reprs !! i patLitCustom var (CustomSP _name _dataRepr size reprs) (NumLit (fromIntegral -> i)) = patLitCustom' var size mask value where ((ConstrRepr' _name _n mask value _anns), _id, _tys) = reprs !! i patLitCustom _ x y = error $ $(curLoc) ++ unwords [ "You can only pass CustomSP / CustomSum and a NumLit to this function," , "not", show x, "and", show y] insts :: [Declaration] -> VHDLM Doc insts [] = emptyDoc insts (TickDecl (Comment c):ds) = comment "--" c <> line <> insts ds insts (TickDecl (Directive d):ds) = pretty d <> ";" <> line <> insts ds insts (d:ds) = do d' <- inst_ d case d' of Just doc -> pure doc <> line <> line <> insts ds _ -> insts ds -- | Helper function for inst_, handling CustomSP and CustomSum inst_' :: Identifier -> Expr -> HWType -> [(Maybe Literal, Expr)] -> VHDLM (Maybe Doc) inst_' id_ scrut scrutTy es = fmap Just $ (pretty id_ <+> larrow <+> align (vcat (conds esNub) <> semi)) where esMod = map (first (fmap (patMod scrutTy))) es esNub = nubBy ((==) `on` fst) esMod var = expr_ True scrut conds :: [(Maybe Literal,Expr)] -> VHDLM [Doc] conds [] = return [] conds [(_,e)] = expr_ False e <:> return [] conds ((Nothing,e):_) = expr_ False e <:> return [] conds ((Just c ,e):es') = expr_ False e <+> "when" <+> patLitCustom var scrutTy c <+> "else" <:> conds es' -- | Turn a Netlist Declaration to a VHDL concurrent block inst_ :: Declaration -> VHDLM (Maybe Doc) inst_ (Assignment id_ Cont e) = fmap Just $ pretty id_ <+> larrow <+> align (expr_ False e) <> semi inst_ (CondAssignment id_ _ scrut _ [(Just (BoolLit b), l),(_,r)]) = fmap Just $ pretty id_ <+> larrow <+> align (vsep (sequence [expr_ False t <+> "when" <+> expr_ False scrut <+> "else" ,expr_ False f <> semi ])) where (t,f) = if b then (l,r) else (r,l) inst_ (CondAssignment id_ _ scrut scrutTy@(CustomSP _ _ _ _) es) = inst_' id_ scrut scrutTy es inst_ (CondAssignment id_ _ scrut scrutTy@(CustomSum _ _ _ _) es) = inst_' id_ scrut scrutTy es inst_ (CondAssignment id_ _ scrut scrutTy@(CustomProduct _ _ _ _ _) es) = inst_' id_ scrut scrutTy es inst_ (CondAssignment id_ _sig scrut scrutTy es) = fmap Just $ "with" <+> parens (expr_ True scrut) <+> "select" <> line <> indent 2 (pretty id_ <+> larrow <+> align (vcat (punctuate comma (conds esNub)) <> semi)) where esMod = map (first (fmap (patMod scrutTy))) es esNub = nubBy ((==) `on` fst) esMod conds :: [(Maybe Literal,Expr)] -> VHDLM [Doc] conds [] = return [] conds [(_,e)] = expr_ False e <+> "when" <+> "others" <:> return [] conds ((Nothing,e):_) = expr_ False e <+> "when" <+> "others" <:> return [] conds ((Just c ,e):es') = expr_ False e <+> "when" <+> patLit scrutTy c <:> conds es' inst_ (InstDecl entOrComp libM _ nm lbl gens pms0) = do maybe (return ()) (\lib -> Ap (libraries %= (T.fromStrict lib:))) libM fmap Just $ nest 2 $ pretty lbl <+> colon <> entOrComp' <+> maybe emptyDoc ((<> ".") . pretty) libM <> pretty nm <> line <> gms <> pms2 <> semi where gms | [] <- gens = emptyDoc | otherwise = do rec (p,ls) <- fmap unzip $ sequence [ (,formalLength i) <$> fill (maximum ls) (expr_ False i) <+> "=>" <+> expr_ False e | (i,_,e) <- gens] nest 2 ("generic map" <> line <> tupled (pure p)) <> line pms2 = do rec (p,ls) <- case pms0 of NamedPortMap pms1 -> fmap unzip $ sequence [pm ls i e | (i,_,_,e) <- pms1] IndexedPortMap pms1 -> fmap unzip $ sequence [pmi e | (_,_,e) <- pms1] nest 2 $ "port map" <> line <> tupled (pure p) pm ls i e = (,formalLength i) <$> fill (maximum ls) (expr_ False i) <+> "=>" <+> expr_ False e pmi e = (,0) <$> expr_ False e formalLength (Identifier i _) = fromIntegral (TextS.length (Id.toText i)) formalLength _ = 0 entOrComp' = case entOrComp of { Entity -> " entity"; Comp -> " component"; Empty -> ""} inst_ (BlackBoxD _ libs imps inc bs bbCtx) = fmap Just (Ap (column (renderBlackBox libs imps inc bs bbCtx))) inst_ (ConditionalDecl cond _) = do traceM $ "WARNING: Conditional compilation is not supported in VHDL. Discarding code conditional on " <> TextS.unpack cond return Nothing inst_ _ = return Nothing -- | Render a data constructor application for data constructors having a -- custom bit representation. customReprDataCon :: DataRepr' -- ^ Custom representation of data type -> ConstrRepr' -- ^ Custom representation of a specific constructor of @dataRepr@ -> [(HWType, Expr)] -- ^ Arguments applied to constructor -> VHDLM Doc customReprDataCon dataRepr constrRepr args = "std_logic_vector'" <> parens (hcat $ punctuate " & " $ mapM range origins) where DataRepr' _typ size _constrs = dataRepr -- Build bit representations for all constructor arguments argSLVs = map (uncurry toSLV) args :: [VHDLM Doc] -- Spread bits of constructor arguments using masks origins = bitOrigins dataRepr constrRepr :: [BitOrigin] range :: BitOrigin -> VHDLM Doc range (Lit (bitsToBits -> ns)) = dquotes $ hcat $ mapM bit_char ns range (Field n start end) = -- We want to select the bits starting from 'start' downto and including -- 'end'. We cannot use "(start downto end)" in VHDL, as the preceeding -- expression might be anything. This notation only works on identifiers -- unfortunately. let fsize = start - end + 1 in let expr' = argSLVs !! n in -- HACK: While expr' is a std_logic_vector (see call `toSLV`), it cannot -- be cast to unsigned in case of literals. This is fixed by explicitly -- casting it to std_logic_vector. let unsigned = "unsigned" <> parens ("std_logic_vector'" <> parens expr') in if | fsize == size -> -- If sizes are equal, rotating / resizing amounts to doing nothing expr' | end == 0 -> -- Rotating is not necessary if relevant bits are already at the end let resized = "resize" <> parens (unsigned <> comma <> int fsize) in "std_logic_vector" <> parens resized | otherwise -> -- Select bits 'start' downto and including 'end' let rotated = unsigned <+> "srl" <+> int end in let resized = "resize" <> parens (rotated <> comma <> int fsize) in "std_logic_vector" <> parens resized -- | Turn a Netlist expression into a VHDL expression expr_ :: HasCallStack => Bool -- ^ Enclose in parentheses? -> Expr -- ^ Expr to convert -> VHDLM Doc expr_ _ (Literal sizeM lit) = exprLit sizeM lit expr_ _ (Identifier id_ Nothing) = pretty id_ expr_ _ (Identifier id_ (Just m)) = do syn <- Ap hdlSyn maybe (pretty id_) (foldr renderModifier (pretty id_)) (buildModifier syn [] m) expr_ b (DataCon _ (DC (Void {}, -1)) [e]) = expr_ b e expr_ _ (DataCon ty@(Vector 0 _) _ _) = sizedQualTyNameErrValue ty expr_ _ (DataCon ty@(Vector 1 elTy) _ [e]) = do syn <- Ap hdlSyn case syn of Vivado -> qualTyName ty <> "'" <> parens (int 0 <+> rarrow <+> toSLV elTy e) _ -> qualTyName ty <> "'" <> parens (int 0 <+> rarrow <+> expr_ False e) expr_ _ e@(DataCon ty@(Vector _ elTy) _ [e1,e2]) = do syn <- Ap hdlSyn case syn of -- When targeting Vivado, arrays must use std_logic_vector for elements. Vivado -> qualTyName ty <> "'" <> case vectorChain e of Just es -> align (tupled (mapM (toSLV elTy) es)) Nothing -> parens ("std_logic_vector'" <> parens (toSLV elTy e1) <+> "&" <+> expr_ False e2) _ -> qualTyName ty <> "'" <> case vectorChain e of Just es -> align (tupled (mapM (expr_ False) es)) Nothing -> parens (qualTyName elTy <> "'" <> parens (expr_ False e1) <+> "&" <+> expr_ False e2) expr_ _ (DataCon ty@(MemBlob n m) _ [n0, m0, _, runs, _, ends]) | Literal _ (NumLit n1) <- n0 , n == fromInteger n1 , Literal _ (NumLit m1) <- m0 , m == fromInteger m1 , Literal Nothing (StringLit runs0) <- runs , Literal Nothing (StringLit ends0) <- ends , es <- unpackNats n m (B8.pack runs0) (B8.pack ends0) = let el val = exprLit (Just (BitVector m, m)) (BitVecLit 0 $ toInteger val) in qualTyName ty <> "'" <> (align $ tupled $ mapM el es) expr_ _ (DataCon ty@(RTree 0 elTy) _ [e]) = do syn <- Ap hdlSyn case syn of Vivado -> qualTyName ty <> "'" <> parens (int 0 <+> rarrow <+> toSLV elTy e) _ -> qualTyName ty <> "'" <> parens (int 0 <+> rarrow <+> expr_ False e) expr_ _ e@(DataCon ty@(RTree d elTy) _ [e1,e2]) = qualTyName ty <> "'" <> case rtreeChain e of Just es -> tupled (mapM (expr_ False) es) Nothing -> parens (qualTyName (RTree (d-1) elTy) <> "'" <> parens (expr_ False e1) <+> "&" <+> expr_ False e2) expr_ _ (DataCon (SP {}) (DC (BitVector _,_)) es) = assignExpr where argExprs = map (parens . expr_ False) es assignExpr = "std_logic_vector'" <> parens (hcat $ punctuate " & " $ sequence argExprs) expr_ _ (DataCon ty@(SP _ args) (DC (_,i)) es) = assignExpr where argTys = snd $ args !! i dcSize = conSize ty + sum (map typeSize argTys) dcExpr = expr_ False (dcToExpr ty i) argExprs = map parens (zipWith toSLV argTys es) extraArg = case typeSize ty - dcSize of 0 -> [] n -> [bits (replicate n U)] assignExpr = "std_logic_vector'" <> parens (hcat $ punctuate " & " $ sequence (dcExpr:argExprs ++ extraArg)) expr_ _ (DataCon ty@(Sum _ _) (DC (_,i)) []) = do RenderEnums enums <- Ap renderEnums if enums then tyName ty <> "'" <> parens (enumVariantName ty i) else expr_ False (dcToExpr ty i) expr_ _ (DataCon ty@(CustomSum _ _ _ tys) (DC (_,i)) []) = let (ConstrRepr' _ _ _ value _) = fst $ tys !! i in "std_logic_vector" <> parens ("to_unsigned" <> parens (int (fromIntegral value) <> comma <> int (typeSize ty))) expr_ _ (DataCon (CustomSP _ dataRepr _size args) (DC (_,i)) es) = let (cRepr, _, argTys) = args !! i in customReprDataCon dataRepr cRepr (zipEqual argTys es) expr_ _ (DataCon (CustomProduct _ dataRepr _size _labels tys) _ es) | DataRepr' _typ _size [cRepr] <- dataRepr = customReprDataCon dataRepr cRepr (zipEqual (map snd tys) es) expr_ _ (DataCon ty@(Product _ labels tys) _ es) = tupled $ zipWithM (\i e' -> tyName ty <> selectProductField labels tys i <+> rarrow <+> expr_ False e') [0..] es expr_ _ (DataCon (Enable _) _ [e]) = expr_ False e expr_ _ (BlackBoxE pNm _ _ _ _ bbCtx _) | pNm == "Clash.Sized.Internal.Signed.fromInteger#" , [Literal _ (NumLit n), Literal _ i] <- extractLiterals bbCtx = exprLit (Just (Signed (fromInteger n),fromInteger n)) i expr_ _ (BlackBoxE pNm _ _ _ _ bbCtx _) | pNm == "Clash.Sized.Internal.Unsigned.fromInteger#" , [Literal _ (NumLit n), Literal _ i] <- extractLiterals bbCtx = exprLit (Just (Unsigned (fromInteger n),fromInteger n)) i expr_ _ (BlackBoxE pNm _ _ _ _ bbCtx _) | pNm == "Clash.Sized.Internal.BitVector.fromInteger#" , [Literal _ (NumLit n), Literal _ m, Literal _ i] <- extractLiterals bbCtx , NumLit m' <- m , NumLit i' <- i = exprLit (Just (BitVector (fromInteger n),fromInteger n)) (BitVecLit m' i') expr_ _ (BlackBoxE pNm _ _ _ _ bbCtx _) | pNm == "Clash.Sized.Internal.BitVector.fromInteger##" , [Literal _ m, Literal _ i] <- extractLiterals bbCtx , NumLit m' <- m , NumLit i' <- i = exprLit (Just (Bit,1)) (BitLit $ toBit m' i') expr_ _ (BlackBoxE pNm _ _ _ _ bbCtx _) | pNm == "Clash.Sized.Internal.Index.fromInteger#" , [Literal _ (NumLit n), Literal _ i] <- extractLiterals bbCtx , Just k <- clogBase 2 n , let k' = max 1 k = exprLit (Just (Unsigned k',k')) i expr_ _ (BlackBoxE pNm _ _ _ _ bbCtx _) | pNm == "Clash.Sized.Internal.Index.maxBound#" , [Literal _ (NumLit n)] <- extractLiterals bbCtx , n > 0 , Just k <- clogBase 2 n , let k' = max 1 k = exprLit (Just (Unsigned k',k')) (NumLit (n-1)) expr_ b (BlackBoxE _ libs imps inc bs bbCtx b') = do parenIf (b || b') (Ap (renderBlackBox libs imps inc bs bbCtx <*> pure 0)) expr_ _ (DataTag Bool (Left id_)) = "tagToEnum" <> parens (pretty id_) expr_ _ (DataTag Bool (Right id_)) = "dataToTag" <> parens (pretty id_) expr_ _ (DataTag hty@(Sum _ _) (Left id_)) = do RenderEnums enums <- Ap renderEnums nm <- Ap $ use modNm let inner = "std_logic_vector" <> parens ("resize" <> parens ("unsigned" <> parens ("std_logic_vector" <> parens (pretty id_)) <> "," <> int (typeSize hty))) if enums then pretty nm <> "_types.fromSLV" <> parens inner else inner expr_ _ (DataTag (Sum _ _) (Right id_)) = do RenderEnums enums <- Ap renderEnums iw <- Ap $ use intWidth nm <- Ap $ use modNm let inner = if enums then pretty nm <> "_types.toSLV" <> parens (pretty id_) else pretty id_ "signed" <> parens ("std_logic_vector" <> parens ("resize" <> parens ("unsigned" <> parens inner <> "," <> int iw))) expr_ _ (DataTag (Product {}) (Right _)) = do iw <- Ap $ use intWidth "to_signed" <> parens (int 0 <> "," <> int iw) expr_ _ (DataTag hty@(SP _ _) (Right id_)) = do { ; iw <- Ap $ use intWidth ; "signed" <> parens ("std_logic_vector" <> parens ( "resize" <> parens ("unsigned" <> parens (pretty id_ <> parens (int start <+> "downto" <+> int end)) <> "," <> int iw))) } where start = typeSize hty - 1 end = typeSize hty - conSize hty expr_ _ (DataTag (Vector 0 _) (Right _)) = do iw <- Ap $ use intWidth "to_signed" <> parens (int 0 <> "," <> int iw) expr_ _ (DataTag (Vector _ _) (Right _)) = do iw <- Ap $ use intWidth "to_signed" <> parens (int 1 <> "," <> int iw) expr_ _ (DataTag (RTree 0 _) (Right _)) = do iw <- Ap $ use intWidth "to_signed" <> parens (int 0 <> "," <> int iw) expr_ _ (DataTag (RTree _ _) (Right _)) = do iw <- Ap $ use intWidth "to_signed" <> parens (int 1 <> "," <> int iw) expr_ _ (ToBv topM hwty e) = do nm <- Ap $ use modNm case topM of Nothing -> pretty nm <> "_types" <> dot <> "toSLV" <> parens (qualTyName hwty <> "'" <> parens (expr_ False e)) Just t -> pretty t <> dot <> pretty t <> "_types" <> dot <> "toSLV" <> parens (expr_ False e) expr_ _ (FromBv topM hwty e) = do nm <- Ap $ use modNm qualTyName hwty <> "'" <> parens (maybe (pretty nm <> "_types" ) (\t -> pretty t <> dot <> pretty t <> "_types") topM <> dot <> "fromSLV" <> parens (expr_ False e)) expr_ _ e = error $ $(curLoc) ++ (show e) -- empty otherSize :: [HWType] -> Int -> Int otherSize _ n | n < 0 = 0 otherSize [] _ = 0 otherSize (a:as) n = typeSize a + otherSize as (n-1) vectorChain :: Expr -> Maybe [Expr] vectorChain (DataCon (Vector 0 _) _ _) = Just [] vectorChain (DataCon (Vector 1 _) _ [e]) = Just [e] vectorChain (DataCon (Vector _ _) _ [e1,e2]) = Just e1 <:> vectorChain e2 vectorChain _ = Nothing rtreeChain :: Expr -> Maybe [Expr] rtreeChain (DataCon (RTree 1 _) _ [e]) = Just [e] rtreeChain (DataCon (RTree _ _) _ [e1,e2]) = liftA2 (++) (rtreeChain e1) (rtreeChain e2) rtreeChain _ = Nothing exprLit :: Maybe (HWType,Size) -> Literal -> VHDLM Doc exprLit Nothing (NumLit i) = integer i exprLit (Just (hty,sz)) (NumLit i) = case hty of Unsigned n | i <= (-2^(31 :: Integer))-> "unsigned" <> parens ("std_logic_vector" <> parens ("signed'" <> parens lit)) | i < 0 -> "unsigned" <> parens ("std_logic_vector" <> parens ("to_signed" <> parens(integer i <> "," <> int n))) | i < 2^(31 :: Integer) -> "to_unsigned" <> parens (integer i <> "," <> int n) | otherwise -> "unsigned'" <> parens lit Signed n | i < 2^(31 :: Integer) && i > (-2^(31 :: Integer)) -> "to_signed" <> parens (integer i <> "," <> int n) | otherwise -> "signed'" <> parens lit BitVector _ -> "std_logic_vector'" <> parens lit Bit -> squotes (int (fromInteger i `mod` 2)) _ -> blit where validHexLit = sz `mod` 4 == 0 && sz /= 0 lit = if validHexLit then hlit else blit blit = bits (toBits sz i) i' = case hty of Signed _ -> let mask = 2^(sz-1) in case divMod i mask of (s,i'') | even s -> i'' | otherwise -> i'' - mask _ -> i `mod` 2^sz hlit = (if i' < 0 then "-" else emptyDoc) <> hex (toHex sz i') exprLit (Just (hty,sz)) (BitVecLit m i) = case m of 0 -> exprLit (Just (hty,sz)) (NumLit i) _ -> "std_logic_vector'" <> parens bvlit where bvlit = bits (toBits' sz m i) exprLit _ (BoolLit t) = if t then "true" else "false" exprLit _ (BitLit b) = squotes $ bit_char b exprLit _ (StringLit s) = pretty . T.pack $ show s exprLit _ l = error $ $(curLoc) ++ "exprLit: " ++ show l patLit :: HWType -> Literal -> VHDLM Doc patLit Bit (NumLit i) = if i == 0 then "'0'" else "'1'" patLit hwty (NumLit i) = do RenderEnums enums <- Ap renderEnums case hwty of Sum{} | enums -> tyName hwty <> "'" <> parens (enumVariantName hwty (fromInteger i)) _ -> let sz = conSize hwty in case sz `mod` 4 of 0 -> hex (toHex sz i) _ -> bits (toBits sz i) patLit _ l = exprLit Nothing l patMod :: HWType -> Literal -> Literal patMod hwTy (NumLit i) = NumLit (i `mod` (2 ^ typeSize hwTy)) patMod _ l = l toBits :: Integral a => Int -> a -> [Bit] toBits size val = map (\x -> if odd x then H else L) $ reverse $ take size $ map (`mod` 2) $ iterate (`div` 2) val toBits' :: Integral a => Int -> a -> a -> [Bit] toBits' size msk val = map (\(m,i) -> if odd m then U else (if odd i then H else L)) $ ( reverse . take size) $ zip ( map (`mod` 2) $ iterate (`div` 2) msk) ( map (`mod` 2) $ iterate (`div` 2) val) bits :: [Bit] -> VHDLM Doc bits = dquotes . hcat . mapM bit_char toHex :: Int -> Integer -> String toHex sz i = case clogBase 16 (2^sz) of Just d -> printf ("%0" ++ show d ++ "X") (abs i) _ -> error "toHex: impossible" hex :: String -> VHDLM Doc hex s = char 'x' <> dquotes (pretty (T.pack s)) bit_char :: Bit -> VHDLM Doc bit_char H = char '1' bit_char L = char '0' bit_char U = do udf <- Ap (use undefValue) case udf of Nothing -> char '-' Just Nothing -> char '0' Just (Just i) -> int i bit_char Z = char 'Z' toSLV :: HasCallStack => HWType -> Expr -> VHDLM Doc toSLV Bool e = do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (expr_ False e) toSLV Bit e = do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (expr_ False e) toSLV (Clock {}) e = do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (expr_ False e) toSLV (ClockN {}) e = do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (expr_ False e) toSLV (Reset {}) e = do nm <- Ap $ use modNm pretty (TextS.toLower nm) <> "_types.toSLV" <> parens (expr_ False e) toSLV (Enable _) e = do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (expr_ False e) toSLV (BitVector _) e = expr_ True e toSLV (Signed _) e = "std_logic_vector" <> parens (expr_ False e) toSLV (Unsigned _) e = "std_logic_vector" <> parens (expr_ False e) toSLV (Index _) e = "std_logic_vector" <> parens (expr_ False e) toSLV (Sum _ _) e = do RenderEnums enums <- Ap renderEnums if enums then do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (expr_ False e) else expr_ False e toSLV (CustomSum _ _dataRepr size reprs) (DataCon _ (DC (_,i)) _) = let (ConstrRepr' _ _ _ value _) = fst $ reprs !! i in let unsigned = "to_unsigned" <> parens (int (fromIntegral value) <> comma <> int size) in "std_logic_vector" <> parens unsigned toSLV (CustomSum {}) e = "std_logic_vector" <> parens (expr_ False e) toSLV t@(Product _ labels tys) (Identifier id_ Nothing) = do selIds' <- sequence selIds encloseSep lparen rparen " & " (zipWithM toSLV tys selIds') where tName = tyName t selNames = map (fmap (Id.unsafeMake . T.toStrict . renderOneLine) ) [pretty id_ <> dot <> tName <> selectProductField labels tys i | i <- [0..(length tys)-1]] selIds = map (fmap (\n -> Identifier n Nothing)) selNames toSLV (Product _ _ tys) (DataCon _ _ es) | equalLength tys es = -- Need equalLenght for code seen in ZipWithUnitVector encloseSep lparen rparen " & " (zipWithM toSLV tys es) toSLV (CustomProduct _ _ _ _ _) e = do -- Custom representations are represented as bitvectors in HDL, so we don't -- need to do anything. expr_ False e toSLV t@(Product _ _ _) e = do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (qualTyName t <> "'" <> parens (expr_ False e)) toSLV (SP _ _) e = expr_ False e toSLV (CustomSP _ _ _ _) e = -- Custom representations are represented as bitvectors in HDL, so we don't -- need to do anything. expr_ False e toSLV (Vector n elTy) (Identifier id_ Nothing) = do selIds' <- sequence selIds syn <- Ap hdlSyn parens (vcat $ punctuate " & " (case syn of Vivado -> mapM (expr_ False) selIds' _ -> mapM (toSLV elTy) selIds')) where selNames = map (fmap (Id.unsafeMake . T.toStrict . renderOneLine) ) $ [pretty id_ <> parens (int i) | i <- [0 .. (n-1)]] selIds = map (fmap (`Identifier` Nothing)) selNames -- Don't split up newtype wrappers, or void-filtered types toSLV (Vector _ _) e@(DataCon _ (DC (Void Nothing, -1)) _) = do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (expr_ False e) toSLV (Vector n elTy) (DataCon _ _ es) = "std_logic_vector'" <> (parens $ vcat $ punctuate " & " (zipWithM toSLV [elTy,Vector (n-1) elTy] es)) toSLV (Vector _ _) e = do nm <- Ap $ use modNm pretty nm <> "_types.toSLV" <> parens (expr_ False e) toSLV (RTree _ _) e = do nm <- Ap (use modNm) pretty (TextS.toLower nm) <> "_types.toSLV" <> parens (expr_ False e) toSLV hty e = error $ $(curLoc) ++ "toSLV:\n\nType: " ++ show hty ++ "\n\nExpression: " ++ show e dcToExpr :: HWType -> Int -> Expr dcToExpr ty i = Literal (Just (ty,conSize ty)) (NumLit (toInteger i)) larrow :: VHDLM Doc larrow = "<=" rarrow :: VHDLM Doc rarrow = "=>" parenIf :: Monad m => Bool -> Ap m Doc -> Ap m Doc parenIf True = parens parenIf False = id punctuate' :: Monad m => Ap m Doc -> Ap m [Doc] -> Ap m Doc punctuate' s d = vcat (punctuate s d) <> s encodingNote :: HWType -> VHDLM Doc encodingNote (Clock _) = "-- clock" <> line encodingNote (ClockN _) = "-- clock (neg phase)" <> line encodingNote (Reset _) = "-- reset" <> line encodingNote (Enable _) = "-- enable" <> line encodingNote (Annotated _ t) = encodingNote t encodingNote _ = emptyDoc tupledSemi :: Applicative f => f [Doc] -> f Doc tupledSemi = align . encloseSep (flatAlt (lparen <+> emptyDoc) lparen) (flatAlt (emptyDoc <+> rparen) rparen) (semi <+> emptyDoc) -- | VHDL name modifiers data VHDLModifier -- | SLV slice (descending index) = Range Range -- | Element selection | Idx Int -- | Array slice (ascending index) | Slice Int Int -- | Selected names | Select (VHDLM Doc) -- | Projecting a 'Word#' out of a 'Word8', or 'Int#' ouf of an 'Int8', see -- [Note] integer projection | Resize -- | Projecting a 'Natural' out of a 'BitVector', see [Note] bitvector projection | ResizeAndConvert -- | Projecting the mask out of a 'BitVector', see [Note] mask projection | DontCare -- | Create a sequence of VHDL name modifiers from our internal 'Modifier' -- data type. Note that the modifiers are in "reverse" order, so build a -- complete modified name using 'foldr' over the list by this function. -- -- [Note] Continuing from an SLV slice -- SOP and custom products are represented as std_logic_vector, this means that -- their elements are also std_logic_vector. So when we project an element out -- of an SOP or custom project, and want to do a further projection on that, -- we have to do further SLV slicing; instead of e.g. creating a 'selected' -- modifier. Finally, when we render the modified name, we have to check -- whether the ultimately projected type needs to be converted from this SLV -- slice, to the proper type. buildModifier :: HasCallStack => HdlSyn -> [(VHDLModifier,HWType)] -- ^ The list of modifiers so far, note that this list is in reverse order -- in which they should eventually be applied to the name we want to modify -> Modifier -> Maybe [(VHDLModifier,HWType)] -- ^ 'Nothing' indicates that the 'Modifier' does not result into a VHDL name -- modifier. i.e. we can use the identifier as is; this happens when we get -- projections out of product types with only one non-zero field. buildModifier _ prevM (Sliced (_,start,end)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice Just (first Range (continueWithRange [(start,end)] hty r) : rest) _ -> Just ((Range (Contiguous start end),hty) : prevM) where hty = BitVector (start-end+1) buildModifier _ prevM (Indexed (ty@(SP _ args),dcI,fI)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice Just (first Range (continueWithRange [(start,end)] argTy r) : rest) _ -> Just ((Range (Contiguous start end),argTy) : prevM) where argTys = snd (indexNote "SOP type: invalid constructor index" args dcI) argTy = indexNote "SOP type: invalid field index" argTys fI argSize = typeSize argTy other = otherSize argTys (fI-1) start = typeSize ty - 1 - conSize ty - other end = start - argSize + 1 buildModifier _ prevM (Indexed (ty@(Product _ labels tys),_,fI)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice let argSize = typeSize argTy otherSz = otherSize tys (fI - 1) start = typeSize ty - 1 - otherSz end = start - argSize + 1 in Just (first Range (continueWithRange [(start,end)] argTy r) : rest) _ -> let d = dot <> tyName ty <> selectProductField labels tys fI in Just ((Select d,argTy):prevM) where argTy = indexNote "Product type: invalid field index" tys fI buildModifier syn prevM (Indexed (ty@(Vector _ argTy),1,0)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice let argSize = typeSize argTy start = typeSize ty - 1 end = start - argSize + 1 in Just (first Range (continueWithRange [(start,end)] argTy r) : rest) | (Slice start _,Vector _ argTyP) <- prev , argTy == argTyP -> -- If the last modifier was an array slice, we just pick its first element Just (vivadoRange syn argTy ((Idx start,argTy):rest)) _ -> Just (vivadoRange syn argTy ((Idx 0,argTy):prevM)) buildModifier _ prevM (Indexed (ty@(Vector n argTy),1,1)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice let argSize = typeSize argTy start = typeSize ty - argSize - 1 in Just (first Range (continueWithRange [(start,0)] tyN r) : rest) | (Slice start end,Vector _ argTyP) <- prev , argTy == argTyP -> -- If the last modifier was an array slice, we just pick the tail of that slice Just ((Slice (start + 1) end,tyN) : rest) _ -> Just ((Slice 1 (n-1),tyN) : prevM) where tyN = Vector (n-1) argTy buildModifier syn prevM (Indexed (ty@(RTree _ argTy),0,0)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice let start = typeSize ty - 1 in Just (first Range (continueWithRange [(start,0)] argTy r) : rest) | (Slice start _,RTree _ argTyP) <- prev , argTy == argTyP -> -- If the last modifier was an array slice, we just pick its first element Just (vivadoRange syn argTy ((Idx start,argTy):rest)) _ -> Just (vivadoRange syn argTy ((Idx 0,argTy):prevM)) buildModifier _ prevM (Indexed (ty@(RTree d argTy),1,0)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice let start = typeSize ty - 1 end = typeSize ty `div` 2 in Just (first Range (continueWithRange [(start,end)] tyN r) : rest) | (Slice start _,RTree _ argTyP) <- prev , argTy == argTyP -> -- If the last modifier was an array slice, we just pick the left half Just ((Slice start (start+z-1),tyN) : rest) _ -> Just ((Slice 0 (z-1),tyN) : prevM) where tyN = RTree (d-1) argTy z = 2^(d - 1) buildModifier _ prevM (Indexed (ty@(RTree d argTy),1,1)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice let start = typeSize ty `div` 2 - 1 in Just (first Range (continueWithRange [(start,0)] tyN r) : rest) | (Slice _ end,RTree _ argTyP) <- prev , argTy == argTyP -> -- If the last modifier was an array slice, we just pick the right half Just ((Slice (end - z + 1) end,tyN) : rest) _ -> Just ((Slice z (z'-1),tyN) : prevM) where tyN = RTree (d-1) argTy z = 2^(d - 1) z' = 2^d -- This is a HACK for Clash.Netlist.Util.mkTopOutput -- Vector's don't have a 10'th constructor, this is just so that we can -- recognize the particular case buildModifier syn prevM (Indexed (ty@(Vector _ argTy),10,fI)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice let argSize = typeSize argTy start = typeSize ty - (fI * argSize) - 1 end = start - argSize + 1 in Just (first Range (continueWithRange [(start,end)] argTy r) : rest) | (Slice start _,Vector _ argTyP) <- prev , argTy == argTyP -> -- If the last modifier was an array slice, we offset from its starting element Just (vivadoRange syn argTy ((Idx (start+fI),argTy):rest)) _ -> Just (vivadoRange syn argTy (((Idx fI,argTy):prevM))) -- This is a HACK for Clash.Netlist.Util.mkTopOutput -- RTree's don't have a 10'th constructor, this is just so that we can -- recognize the particular case buildModifier syn prevM (Indexed (ty@(RTree _ argTy),10,fI)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice let argSize = typeSize argTy start = typeSize ty - (fI * argSize) - 1 end = start - argSize + 1 in Just (first Range (continueWithRange [(start,end)] argTy r) : rest) | (Slice start _,RTree 1 argTyP) <- prev , argTy == argTyP -> -- If the last modifier was an array slice, we offset from its starting element Just (vivadoRange syn argTy ((Idx (start+fI),argTy):rest)) _ -> Just (vivadoRange syn argTy ((Idx fI,argTy):prevM)) buildModifier _ prevM (Indexed (CustomSP _ dataRepr size args,dcI,fI)) | Void {} <- argTy = error (unexpectedProjectionErrorMsg dataRepr dcI fI) | otherwise = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice Just (first Range (continueWithRange ses argTy r) : rest) _ -> Just (first Range (continueWithRange ses argTy (Contiguous (size-1) 0)) : prevM) where (ConstrRepr' _name _n _mask _value anns, _, argTys) = indexNote "Custom SOP type: invalid constructor index" args dcI ses = bitRanges (indexNote "Custom SOP type: invalid annotation index" anns fI) argTy = indexNote "Custom SOP type: invalid field index" argTys fI buildModifier _ prevM (Indexed (CustomProduct _ dataRepr size _ args,dcI,fI)) | Void {} <- argTy = error (unexpectedProjectionErrorMsg dataRepr dcI fI) | DataRepr' _typ _size [cRepr] <- dataRepr , ConstrRepr' _cName _pos _mask _val fieldAnns <- cRepr , let ses = bitRanges (indexNote "Custom product type: invalid annotation index" fieldAnns fI) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice Just (first Range (continueWithRange ses argTy r) : rest) _ -> Just (first Range (continueWithRange ses argTy (Contiguous (size-1) 0)):prevM) where argTy = snd (indexNote "Custom product type: invalid field index" args fI) buildModifier _ prevM (DC (ty@(SP _ _),_)) = case prevM of (prev:rest) | (Range r,_) <- prev -> -- See [Note] Continuing from an SLV slice Just (first Range (continueWithRange [(start,end)] tyN r) : rest) _ -> Just ((Range (Contiguous start end),tyN):prevM) where start = typeSize ty - 1 end = typeSize ty - conSize ty tyN = BitVector (start - end + 1) buildModifier syn prevM (Nested m1 m2) = case buildModifier syn prevM m1 of Nothing -> buildModifier syn prevM m2 Just prevM1 -> case buildModifier syn prevM1 m2 of -- In case the second modifier is `Nothing` that means we want the entire -- thing calculated by the first modifier Nothing -> Just prevM1 m -> m -- [Note] integer projection -- -- The idea behind these expressions is to translate cases like: -- -- > :: Int8 -> Int# -- > \case I8# i -> i -- -- Which is fine, because no bits are lost. However, these expression might -- also be the result of the W/W transformation (or uses of unsafeToInteger) -- for: -- -- > :: Signed 128 -> Integer -- > \case S i -> i -- -- which is very bad because `Integer` is represented by 64 bits meaning we -- we lose the top 64 bits in the above translation. -- -- Just as bad is that -- -- > :: Word8 -> Word# -- > \case W8# w -> w -- -- > :: Unsigned 8 -> Integer -- > \case U i -> i -- -- result in the same expression... even though their resulting types are -- different. TODO: this needs to be fixed! buildModifier _ prevM (Indexed (ty@(Signed _),_,_)) = Just ((Resize,ty):prevM) buildModifier _ prevM (Indexed (ty@(Unsigned _),_,_)) = Just ((Resize,ty):prevM) -- [Note] mask projection -- -- This covers the case of either: -- -- `Clash.Sized.Internal.BitVector.unsafeToMask` or -- -- > :: BitVector 8 -> Integer -- > \case BV m wild -> m -- -- introduced by the W/W transformation. Both of which we prefer not to see -- but will allow. Since the mask is pretty much a simulation artifact we -- emit don't cares so stuff gets optimised away. buildModifier _ prevM (Indexed (ty@(BitVector _),_,0)) = Just ((DontCare,ty):prevM) -- [Note] bitvector projection -- -- This covers the case of either: -- -- `Clash.Sized.Internal.BitVector.unsafeToNatural` or -- -- > :: BitVector 8 -> Integer -- > \case BV wild i -> i -- -- introduced by the W/W transformation. Both of which we prefer not to see -- but will allow. buildModifier _ prevM (Indexed (ty@(BitVector _),_,1)) = Just ((ResizeAndConvert,ty):prevM) buildModifier _ _ _ = Nothing -- | Add an SLV slice for the entire element when we're in the Vivado code-path. -- This is needed after an element projection from an array (Vec or RTree), as -- elements are stored as SLVs in the Vivado code-path. This enabled two things: -- -- 1. Nested modifiers treat the projected element as an SLV, and adjust their -- projection behavior accordingly. -- 2. Projected elements are converted from SLV to the proper VHDL type. vivadoRange :: HdlSyn -> HWType -> [(VHDLModifier, HWType)] -> [(VHDLModifier, HWType)] vivadoRange syn ty mods = case syn of Vivado -> (Range (Contiguous (typeSize ty - 1) 0),ty):mods _ -> mods -- | Render a VHDL modifier on to of a (potentially modified) VHDL name renderModifier :: (VHDLModifier,HWType) -> VHDLM Doc -- ^ (Potentially modified) VHDL name -> VHDLM Doc -- ^ Modified VHDL name renderModifier (Idx n,_) doc = doc <> parens (int n) renderModifier (Slice start end,_) doc = doc <> parens (int start <+> "to" <+> int end) renderModifier (Select sel,_) doc = doc <> sel -- See [Note] integer projection renderModifier (Resize,ty) doc = do iw <- Ap (use intWidth) -- These integer projections always come last, so it's safe not to return a -- modified name, but an expression instead. traceIf (iw < typeSize ty) ($(curLoc) ++ "WARNING: result smaller than argument") $ "resize" <> parens (doc <> "," <> int iw) renderModifier (ResizeAndConvert,ty) doc = do iw <- Ap (use intWidth) -- These natural projections always come last, so it's safe not to return a -- modified name, but an expression instead. traceIf (iw < typeSize ty) ($(curLoc) ++ "WARNING: result smaller than argument") $ "resize" <> parens ("unsigned" <> parens doc <> "," <> int iw) -- See [Note] mask projection renderModifier (DontCare,_) _ = do iw <- Ap (use intWidth) -- These mask projections always come last, so it's safe not to return a -- modified name, but an expression instead. traceIf True ($(curLoc) ++ "WARNING: rendering bitvector mask as dontcare") $ sizedQualTyNameErrValue (Unsigned iw) renderModifier (Range r,t) doc = do nm <- Ap (use modNm) enums <- Ap renderEnums let doc1 = case r of Contiguous start end -> slice start end Split rs -> parens (hcat (punctuate " & " (mapM (\(s,e,_) -> slice s e) rs))) case normaliseType enums t of BitVector _ -> doc1 -- See [Note] Continuing from an SLV slice _ -> qualTyName t <> "'" <> parens (pretty (TextS.toLower nm) <> "_types.fromSLV" <> parens doc1) where slice s e = doc <> parens (int s <+> "downto" <+> int e)