import qualified Maybe
import qualified DataCon
import qualified CoreUtils
+import qualified Data.Traversable as Traversable
+import qualified Data.Foldable as Foldable
import Control.Applicative
import Outputable ( showSDoc, ppr )
import qualified Control.Monad.State as State
where
tycount = length $ DataCon.dataConAllTyVars dc
-genSignalUses ::
+genSignals ::
Type.Type
- -> FlattenState (SignalUseMap UnnamedSignal)
-
-genSignalUses ty = do
- typeMapToUseMap tymap
+ -> FlattenState (SignalMap UnnamedSignal)
+
+genSignals ty =
+ -- First generate a map with the right structure containing the types, and
+ -- generate signals for each of them.
+ Traversable.mapM (\ty -> genSignalId SigInternal ty) (mkHsValueMap ty)
+
+-- | Marks a signal as the given SigUse, if its id is in the list of id's
+-- given.
+markSignal :: SigUse -> [UnnamedSignal] -> (UnnamedSignal, SignalInfo) -> (UnnamedSignal, SignalInfo)
+markSignal use ids (id, info) =
+ (id, info')
where
- -- First generate a map with the right structure containing the types
- tymap = mkHsValueMap ty
-
-typeMapToUseMap ::
- HsValueMap Type.Type
- -> FlattenState (SignalUseMap UnnamedSignal)
-
-typeMapToUseMap (Single ty) = do
- id <- genSignalId
- return $ Single (SignalUse id)
-
-typeMapToUseMap (Tuple tymaps) = do
- usemaps <- State.mapM typeMapToUseMap tymaps
- return $ Tuple usemaps
+ info' = if id `elem` ids then info { sigUse = use} else info
-- | Flatten a haskell function
flattenFunction ::
flattenFunction _ (Rec _) = error "Recursive binders not supported"
flattenFunction hsfunc bind@(NonRec var expr) =
- FlatFunction args res apps conds
+ FlatFunction args res apps conds sigs'
where
- init_state = ([], [], 0)
+ init_state = ([], [], [], 0)
(fres, end_state) = State.runState (flattenExpr [] expr) init_state
(args, res) = fres
- (apps, conds, _) = end_state
+ portlist = concat (map Foldable.toList (res:args))
+ (apps, conds, sigs, _) = end_state
+ sigs' = fmap (markSignal SigPort portlist) sigs
flattenExpr ::
BindMap
-> CoreExpr
- -> FlattenState ([SignalDefMap UnnamedSignal], (SignalUseMap UnnamedSignal))
+ -> FlattenState ([SignalMap UnnamedSignal], (SignalMap UnnamedSignal))
flattenExpr binds lam@(Lam b expr) = do
-- Find the type of the binder
let (arg_ty, _) = Type.splitFunTy (CoreUtils.exprType lam)
-- Create signal names for the binder
- defs <- genSignalUses arg_ty
+ defs <- genSignals arg_ty
let binds' = (b, Left defs):binds
(args, res) <- flattenExpr binds' expr
- return ((useMapToDefMap defs) : args, res)
+ return (defs : args, res)
flattenExpr binds (Var id) =
case bind of
-- Check and split each of the arguments
let (_, arg_ress) = unzip (zipWith checkArg args flat_args)
-- Generate signals for our result
- res <- genSignalUses ty
+ res <- genSignals ty
-- Create the function application
let app = FApp {
appFunc = func,
appArgs = arg_ress,
- appRes = useMapToDefMap res
+ appRes = res
}
addApp app
return ([], res)
-> Var.Var -- The scrutinee
-> CoreBndr -- The binder to bind the scrutinee to
-> CoreAlt -- The single alternative
- -> FlattenState ( [SignalDefMap UnnamedSignal], SignalUseMap UnnamedSignal)
+ -> FlattenState ( [SignalMap UnnamedSignal], SignalMap UnnamedSignal)
-- See expandExpr
flattenSingleAltCaseExpr binds v b alt@(DataAlt datacon, bind_vars, expr) =
if not (DataCon.isTupleCon datacon)