ajhc-0.8.0.1: drift_processed/E/CPR.hs
{- Generated by DrIFT (Automatic class derivations for Haskell) -}
{-# LINE 1 "src/E/CPR.hs" #-}
module E.CPR(Val(..), cprAnalyzeDs, cprAnalyzeProgram) where
import Control.Monad.Writer(runWriter,tell,Monoid(..))
import Data.Binary
import Data.Monoid()
import Data.Typeable
import qualified Data.Map as Map
import Cmm.Number
import DataConstructors
import Doc.DocLike
import E.E
import E.Program
import GenUtil
import Name.Name
import Name.Names
import Name.VConsts
import Util.SameShape
import qualified Doc.Chars as C
import qualified E.Demand as Demand
import qualified Info.Info as Info
newtype Env = Env (Map.Map TVr Val)
deriving(Monoid)
data Val =
Top -- the top.
| Fun Val -- function taking an arg
| Tup Name [Val] -- A constructed product
| VInt Number -- A number
| Tag [Name] -- A nullary constructor, like True, False
| Bot -- the bottom
deriving(Eq,Ord,Typeable)
{-! derive: Binary !-}
trimVal v = f (0::Int) v where
f !n Tup {} | n > 5 = Top
f n (Tup x vs) = Tup x (map (f (n + 1)) vs)
f n (Fun v) = Fun (f n v)
f _ x = x
toVal c = case conSlots c of
[] -> Tag [conName c]
ss -> Tup (conName c) [ Top | _ <- ss]
instance Show Val where
showsPrec _ Top = C.top
showsPrec _ Bot = C.bot
showsPrec n (Fun v) = C.lambda <> showsPrec n v
showsPrec _ (Tup n [x,xs]) | n == dc_Cons = shows x <> showChar ':' <> shows xs
showsPrec _ (Tup n xs) | Just _ <- fromTupname n = tupled (map shows xs)
showsPrec _ (Tup n xs) = shows n <> tupled (map shows xs)
showsPrec _ (VInt n) = shows n
showsPrec _ (Tag [n]) | n == dc_EmptyList = showString "[]"
showsPrec _ (Tag [n]) = shows n
showsPrec _ (Tag ns) = shows ns
lub :: Val -> Val -> Val
lub Bot a = a
lub a Bot = a
lub Top a = Top
lub a Top = Top
lub (Tup a xs) (Tup b ys)
| a == b, sameShape1 xs ys = Tup a (zipWith lub xs ys)
| a == b = error "CPR.lub this shouldn't happen"
| otherwise = Top
lub (Fun l) (Fun r) = Fun (lub l r)
lub (VInt n) (VInt n') | n == n' = VInt n
lub (Tag xs) (Tag ys) = Tag (smerge xs ys)
lub (Tag _) (Tup _ _) = Top
lub (Tup _ _) (Tag _) = Top
lub _ _ = Top
--lub a b = error $ "CPR.lub: " ++ show (a,b)
instance Monoid Val where
mempty = Bot
mappend = lub
{-# NOINLINE cprAnalyzeProgram #-}
cprAnalyzeProgram :: Program -> Program
cprAnalyzeProgram prog = ans where
nds = cprAnalyzeDs (progDataTable prog) (programDs prog)
ans = programSetDs' nds prog -- { progStats = progStats prog `mappend` stats }
cprAnalyzeDs :: DataTable -> [(TVr,E)] -> [(TVr,E)]
cprAnalyzeDs dataTable ds = fst $ cprAnalyzeBinds dataTable mempty ds
cprAnalyzeBinds :: DataTable -> Env -> [(TVr,E)] -> ([(TVr,E)],Env)
cprAnalyzeBinds dataTable env bs = f env (decomposeDs bs) [] where
f env (Left (t,e):rs) zs = case cprAnalyze dataTable env e of
(e',v) -> f (envInsert t v env) rs ((tvrInfo_u (Info.insert $ trimVal v) t,e'):zs)
f env (Right xs:rs) zs = g (length xs + 2) ([ (t,(e,Bot)) | (t,e) <- xs]) where
g 0 mp = f nenv rs ([ (tvrInfo_u (Info.insert $ trimVal b) t,e) | (t,(e,b)) <- mp] ++ zs) where
nenv = Env (Map.fromList [ (t,b) | (t,(e,b)) <- mp]) `mappend` env
g n mp = g (n - 1) [ (t,cprAnalyze dataTable nenv e) | (t,e) <- xs] where
nenv = Env (Map.fromList [ (t,b) | (t,(e,b)) <- mp]) `mappend` env
f env [] zs = (reverse zs,env)
envInsert :: TVr -> Val -> Env -> Env
envInsert tvr val (Env mp) = Env $ Map.insert tvr val mp
cprAnalyze :: DataTable -> Env -> E -> (E,Val)
cprAnalyze dataTable env e = cprAnalyze' env e where
cprAnalyze' (Env mp) (EVar v)
| Just t <- Map.lookup v mp = (EVar v,t)
| Just t <- Info.lookup (tvrInfo v) = (EVar v,t)
| otherwise = (EVar v,Top)
cprAnalyze' env ELetRec { eDefs = ds, eBody = e } = (ELetRec ds' e',val) where
(ds',env') = cprAnalyzeBinds dataTable env ds
(e',val) = cprAnalyze' (env' `mappend` env) e
cprAnalyze' env (ELam t e)
| Just (Demand.S _) <- Info.lookup (tvrInfo t), Just c <- getProduct dataTable (tvrType t) = let
(e',val) = cprAnalyze' (envInsert t (toVal c) env) e
in (ELam t e',Fun val)
cprAnalyze' env (ELam t e) = (ELam t e',Fun val) where
(e',val) = cprAnalyze' (envInsert t Top env) e
cprAnalyze' env ec@(ECase {}) = runWriter (caseBodiesMapM f ec) where
f e = do
(e',v) <- return $ cprAnalyze' env e
tell v
return e'
cprAnalyze' env (EAp fun arg) = (EAp fun_cpr arg,res_res) where
(fun_cpr, fun_res) = cprAnalyze' env fun
res_res = case fun_res of
Fun x -> x
Top -> Top
Bot -> Bot
v -> error $ "cprAnalyze'.res_res: " ++ show v
cprAnalyze' env e = (e,f e) where
f (ELit (LitInt n _)) = VInt n
f (ELit LitCons { litName = n, litArgs = [], litType = _ }) = Tag [n]
f (ELit LitCons { litName = n, litArgs = xs, litType = _ }) = Tup n (map g xs)
f (EPi t e) = Tup tc_Arrow [g $ tvrType t, g e]
f (EPrim {}) = Top -- TODO fix primitives
f (EError {}) = Bot
f e = error $ "cprAnalyze'.f: " ++ show e
g = snd . cprAnalyze' env
{-* Generated by DrIFT : Look, but Don't Touch. *-}
instance Data.Binary.Binary Val where
put Top = do
Data.Binary.putWord8 0
put (Fun aa) = do
Data.Binary.putWord8 1
Data.Binary.put aa
put (Tup ab ac) = do
Data.Binary.putWord8 2
Data.Binary.put ab
Data.Binary.put ac
put (VInt ad) = do
Data.Binary.putWord8 3
Data.Binary.put ad
put (Tag ae) = do
Data.Binary.putWord8 4
Data.Binary.put ae
put Bot = do
Data.Binary.putWord8 5
get = do
h <- Data.Binary.getWord8
case h of
0 -> do
return Top
1 -> do
aa <- Data.Binary.get
return (Fun aa)
2 -> do
ab <- Data.Binary.get
ac <- Data.Binary.get
return (Tup ab ac)
3 -> do
ad <- Data.Binary.get
return (VInt ad)
4 -> do
ae <- Data.Binary.get
return (Tag ae)
5 -> do
return Bot
_ -> fail "invalid binary data found"
-- Imported from other files :-