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
Type.Type
-> FlattenState (SignalMap UnnamedSignal)
-genSignals ty = do
- typeMapToUseMap tymap
- where
- -- First generate a map with the right structure containing the types
- tymap = mkHsValueMap ty
-
-typeMapToUseMap ::
- HsValueMap Type.Type
- -> 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)
-typeMapToUseMap (Single ty) = do
- id <- genSignalId ty
- return $ Single id
-
-typeMapToUseMap (Tuple tymaps) = do
- usemaps <- State.mapM typeMapToUseMap tymaps
- return $ Tuple usemaps
+-- | 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
+ 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 sigs
+ FlatFunction args res apps conds sigs'
where
init_state = ([], [], [], 0)
(fres, end_state) = State.runState (flattenExpr [] expr) init_state
(args, res) = fres
+ portlist = concat (map Foldable.toList (res:args))
(apps, conds, sigs, _) = end_state
+ sigs' = fmap (markSignal SigPort portlist) sigs
flattenExpr ::
BindMap
hsargs = map (useAsPort . mkHsValueMap . CoreUtils.exprType) args
hsres = useAsPort (mkHsValueMap ty)
+-- | Translates signal id's to SignalInfo for any signals used as state.
+findState ::
+ [(UnnamedSignal, SignalInfo)] -- | A map of id to info
+ -> UnnamedSignal -- | The signal id to look at
+ -> HsValueUse -- | How is this signal used?
+ -> Maybe (Int, SignalInfo) -- | The state num and SignalInfo, if appropriate
+
+findState sigs id (State num) =
+ Just (num, Maybe.fromJust $ lookup id sigs)
+findState _ _ _ = Nothing
+
+
+-- | Returns pairs of signals that should be mapped to state in this function.
+getOwnStates ::
+ HsFunction -- | The function to look at
+ -> FlatFunction -- | The function to look at
+ -> [(Int, SignalInfo, SignalInfo)]
+ -- | The state signals. The first is the state number, the second the
+ -- signal to assign the current state to, the last is the signal
+ -- that holds the new state.
+
+getOwnStates hsfunc flatfunc =
+ [(old_num, old_info, new_info)
+ | (old_num, old_info) <- args_states
+ , (new_num, new_info) <- res_states
+ , old_num == new_num]
+ where
+ sigs = flat_sigs flatfunc
+ -- Translate args and res to lists of (statenum, SignalInfo)
+ args = zipWith (zipValueMapsWith $ findState sigs) (flat_args flatfunc) (hsFuncArgs hsfunc)
+ args_states = Maybe.catMaybes $ concat $ map Foldable.toList $ args
+ res = zipValueMapsWith (findState sigs) (flat_res flatfunc) (hsFuncRes hsfunc)
+ res_states = Maybe.catMaybes $ Foldable.toList res
+
+
-- vim: set ts=8 sw=2 sts=2 expandtab: