%
-% (c) The GRASP/AQUA Project, Glasgow University, 1992-1996
+% (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
%
\section[DsListComp]{Desugaring list comprehensions}
\begin{code}
-#include "HsVersions.h"
-
module DsListComp ( dsListComp ) where
-IMP_Ubiq()
-#if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ <= 201
-IMPORT_DELOOPER(DsLoop) -- break dsExpr-ish loop
-#else
-import {-# SOURCE #-} DsExpr ( dsExpr )
-import {-# SOURCE #-} DsBinds ( dsBinds )
-#endif
+#include "HsVersions.h"
+
+import {-# SOURCE #-} DsExpr ( dsExpr, dsLet )
-import HsSyn ( Stmt(..), HsExpr, HsBinds )
-import TcHsSyn ( SYN_IE(TypecheckedStmt), SYN_IE(TypecheckedHsExpr) , SYN_IE(TypecheckedHsBinds) )
+import BasicTypes ( Boxity(..) )
+import HsSyn ( OutPat(..), HsExpr(..), Stmt(..) )
+import TcHsSyn ( TypecheckedStmt )
import DsHsSyn ( outPatType )
import CoreSyn
import DsUtils
import CmdLineOpts ( opt_FoldrBuildOn )
-import CoreUtils ( coreExprType, mkCoreIfThenElse )
-import Id ( SYN_IE(Id) )
-import PrelVals ( mkBuild, foldrId )
-import Type ( mkTyVarTy, mkForAllTy, mkFunTys, mkFunTy, SYN_IE(Type) )
-import TysPrim ( alphaTy )
-import TysWiredIn ( nilDataCon, consDataCon, listTyCon )
-import TyVar ( alphaTyVar )
+import CoreUtils ( exprType, mkIfThenElse )
+import Id ( idType )
+import Var ( Id )
+import Type ( mkTyVarTy, mkFunTys, mkFunTy, Type )
+import TysPrim ( alphaTyVar )
+import TysWiredIn ( nilDataCon, consDataCon, unitDataConId, tupleCon, mkListTy, mkTupleTy )
import Match ( matchSimply )
-import Util ( panic )
+import PrelNames ( foldrName, buildName )
+import List ( zip4 )
\end{code}
List comprehensions may be desugared in one of two ways: ``ordinary''
dsListComp quals elt_ty
| not opt_FoldrBuildOn -- Be boring
- = deListComp quals nil_expr
+ = deListComp quals (mkNilExpr elt_ty)
| otherwise -- foldr/build lives!
= newTyVarsDs [alphaTyVar] `thenDs` \ [n_tyvar] ->
let
- alpha_to_alpha = alphaTy `mkFunTy` alphaTy
-
n_ty = mkTyVarTy n_tyvar
c_ty = mkFunTys [elt_ty, n_ty] n_ty
- g_ty = mkForAllTy alphaTyVar (
- (elt_ty `mkFunTy` alpha_to_alpha)
- `mkFunTy`
- alpha_to_alpha
- )
in
- newSysLocalsDs [c_ty,n_ty,g_ty] `thenDs` \ [c, n, g] ->
+ newSysLocalsDs [c_ty,n_ty] `thenDs` \ [c, n] ->
- dfListComp c_ty c
- n_ty n
- quals `thenDs` \ result ->
+ dfListComp c n quals `thenDs` \ result ->
- returnDs (mkBuild elt_ty n_tyvar c n g result)
- where
- nil_expr = mkCon nilDataCon [] [elt_ty] []
+ dsLookupGlobalValue buildName `thenDs` \ build_id ->
+ returnDs (Var build_id `App` Type elt_ty
+ `App` mkLams [n_tyvar, c, n] result)
\end{code}
%************************************************************************
is the TE translation scheme. Note that we carry around the @L@ list
already desugared. @dsListComp@ does the top TE rule mentioned above.
+To the above, we add an additional rule to deal with parallel list
+comprehensions. The translation goes roughly as follows:
+ [ e | p1 <- e11, let v1 = e12, p2 <- e13
+ | q1 <- e21, let v2 = e22, q2 <- e23]
+ =>
+ [ e | ((p1,v1,p2), (q1,v2,q2)) <-
+ zip [(p1,v1,p2) | p1 <- e11, let v1 = e12, p2 <- e13]
+ [(q1,v2,q2) | q1 <- e21, let v2 = e22, q2 <- e23]]
+In the translation below, the ParStmtOut branch translates each parallel branch
+into a sub-comprehension, and desugars each independently. The resulting lists
+are fed to a zip function, we create a binding for all the variables bound in all
+the comprehensions, and then we hand things off the the desugarer for bindings.
+The zip function is generated here a) because it's small, and b) because then we
+don't have to deal with arbitrary limits on the number of zip functions in the
+prelude, nor which library the zip function came from.
+The introduced tuples are Boxed, but only because I couldn't get it to work
+with the Unboxed variety.
+
\begin{code}
+
deListComp :: [TypecheckedStmt] -> CoreExpr -> DsM CoreExpr
-deListComp [ReturnStmt expr] list -- Figure 7.4, SLPJ, p 135, rule C above
+deListComp (ParStmtOut bndrstmtss : quals) list
+ = mapDs doListComp qualss `thenDs` \ exps ->
+ mapDs genAS bndrss `thenDs` \ ass ->
+ mapDs genA bndrss `thenDs` \ as ->
+ mapDs genAS' bndrss `thenDs` \ as's ->
+ let retTy = myTupleTy Boxed (length bndrss) qualTys
+ zipTy = foldr mkFunTy (mkListTy retTy) (map mkListTy qualTys)
+ in
+ newSysLocalDs zipTy `thenDs` \ zipFn ->
+ let target = mkConsExpr retTy (mkTupleExpr as) (foldl App (Var zipFn) (map Var as's))
+ zipExp = mkLet zipFn (zip4 bndrss ass as as's) exps target
+ in
+ deBindComp pat zipExp quals list
+ where (bndrss, stmtss) = unzip bndrstmtss
+ pats = map (\ps -> mkTuplePat (map VarPat ps)) bndrss
+ mkTuplePat [p] = p
+ mkTuplePat ps = TuplePat ps Boxed
+ pat = TuplePat pats Boxed
+
+ qualss = map mkQuals bndrstmtss
+ mkQuals (bndrs, stmts) = (bndrs, stmts ++ [ReturnStmt (myTupleExpr bndrs)])
+
+ qualTys = map mkBndrsTy bndrss
+ mkBndrsTy bndrs = myTupleTy Boxed (length bndrs) (map idType bndrs)
+
+ doListComp (bndrs, stmts)
+ = dsListComp stmts (mkBndrsTy bndrs)
+ genA bndrs = newSysLocalDs (mkBndrsTy bndrs)
+ genAS bndrs = newSysLocalDs (mkListTy (mkBndrsTy bndrs))
+ genAS' bndrs = newSysLocalDs (mkListTy (mkBndrsTy bndrs))
+
+ mkLet zipFn vars exps target
+ = Let (Rec [(zipFn,
+ foldr Lam (mkBody target vars) (map getAs vars))])
+ (foldl App (Var zipFn) exps)
+ getAs (_, as, _, _) = as
+ mkBody target vars
+ = foldr mkCase (foldr mkTuplCase target vars) vars
+ mkCase (ps, as, a, as') rest
+ = Case (Var as) as [(DataAlt nilDataCon, [], mkConApp nilDataCon []),
+ (DataAlt consDataCon, [a, as'], rest)]
+ mkTuplCase ([p], as, a, as') rest
+ = App (Lam p rest) (Var a)
+ mkTuplCase (ps, as, a, as') rest
+ = Case (Var a) a [(DataAlt (tupleCon Boxed (length ps)), ps, rest)]
+
+ myTupleTy boxity arity [ty] = ty
+ myTupleTy boxity arity tys = mkTupleTy boxity arity tys
+ myTupleExpr [] = HsVar unitDataConId
+ myTupleExpr [id] = HsVar id
+ myTupleExpr ids = ExplicitTuple [ HsVar i | i <- ids ] Boxed
+
+deListComp [ReturnStmt expr] list -- Figure 7.4, SLPJ, p 135, rule C above
= dsExpr expr `thenDs` \ core_expr ->
- mkConDs consDataCon [TyArg (coreExprType core_expr), VarArg core_expr, VarArg list]
+ returnDs (mkConsExpr (exprType core_expr) core_expr list)
deListComp (GuardStmt guard locn : quals) list -- rule B above
= dsExpr guard `thenDs` \ core_guard ->
deListComp quals list `thenDs` \ core_rest ->
- returnDs (mkCoreIfThenElse core_guard core_rest list)
+ returnDs (mkIfThenElse core_guard core_rest list)
-- [e | let B, qs] = let B in [e | qs]
deListComp (LetStmt binds : quals) list
- = dsBinds False{-don't auto scc-} binds `thenDs` \ core_binds ->
- deListComp quals list `thenDs` \ core_rest ->
- returnDs (mkCoLetsAny core_binds core_rest)
+ = deListComp quals list `thenDs` \ core_rest ->
+ dsLet binds core_rest
deListComp (BindStmt pat list1 locn : quals) core_list2 -- rule A' above
= dsExpr list1 `thenDs` \ core_list1 ->
- let
- u3_ty@u1_ty = coreExprType core_list1 -- two names, same thing
+ deBindComp pat core_list1 quals core_list2
+
+deBindComp pat core_list1 quals core_list2
+ = let
+ u3_ty@u1_ty = exprType core_list1 -- two names, same thing
-- u1_ty is a [alpha] type, and u2_ty = alpha
u2_ty = outPatType pat
- res_ty = coreExprType core_list2
+ res_ty = exprType core_list2
h_ty = u1_ty `mkFunTy` res_ty
in
newSysLocalsDs [h_ty, u1_ty, u2_ty, u3_ty] `thenDs` \ [h, u1, u2, u3] ->
-- the "fail" value ...
- mkAppDs (Var h) [VarArg (Var u3)] `thenDs` \ core_fail ->
+ let
+ core_fail = App (Var h) (Var u3)
+ letrec_body = App (Var h) core_list1
+ in
deListComp quals core_fail `thenDs` \ rest_expr ->
- matchSimply (Var u2) pat res_ty
+ matchSimply (Var u2) ListCompMatch pat
rest_expr core_fail `thenDs` \ core_match ->
- mkAppDs (Var h) [VarArg core_list1] `thenDs` \ letrec_body ->
-
- returnDs (
- mkCoLetrecAny [
- ( h,
- (Lam (ValBinder u1)
- (Case (Var u1)
- (AlgAlts
- [(nilDataCon, [], core_list2),
- (consDataCon, [u2, u3], core_match)]
- NoDefault)))
- )] letrec_body
- )
+ let
+ rhs = Lam u1 $
+ Case (Var u1) u1 [(DataAlt nilDataCon, [], core_list2),
+ (DataAlt consDataCon, [u2, u3], core_match)]
+ in
+ returnDs (Let (Rec [(h, rhs)]) letrec_body)
\end{code}
+
%************************************************************************
%* *
\subsection[DsListComp-foldr-build]{Foldr/Build desugaring of list comprehensions}
%************************************************************************
@dfListComp@ are the rules used with foldr/build turned on:
+
\begin{verbatim}
-TE < [ e | ] >> c n = c e n
-TE << [ e | b , q ] >> c n = if b then TE << [ e | q ] >> c n else n
-TE << [ e | p <- l , q ] c n = foldr
- (\ TE << p >> b -> TE << [ e | q ] >> c b
- _ b -> b) n l
+TE[ e | ] c n = c e n
+TE[ e | b , q ] c n = if b then TE[ e | q ] c n else n
+TE[ e | p <- l , q ] c n = let
+ f = \ x b -> case x of
+ p -> TE[ e | q ] c b
+ _ -> b
+ in
+ foldr f n l
\end{verbatim}
+
\begin{code}
-dfListComp :: Type -> Id -- 'c'; its type and id
- -> Type -> Id -- 'n'; its type and id
+dfListComp :: Id -> Id -- 'c' and 'n'
-> [TypecheckedStmt] -- the rest of the qual's
-> DsM CoreExpr
-dfListComp c_ty c_id n_ty n_id [ReturnStmt expr]
+dfListComp c_id n_id [ReturnStmt expr]
= dsExpr expr `thenDs` \ core_expr ->
- mkAppDs (Var c_id) [VarArg core_expr, VarArg (Var n_id)]
+ returnDs (mkApps (Var c_id) [core_expr, Var n_id])
-dfListComp c_ty c_id n_ty n_id (GuardStmt guard locn : quals)
+dfListComp c_id n_id (GuardStmt guard locn : quals)
= dsExpr guard `thenDs` \ core_guard ->
- dfListComp c_ty c_id n_ty n_id quals `thenDs` \ core_rest ->
- returnDs (mkCoreIfThenElse core_guard core_rest (Var n_id))
+ dfListComp c_id n_id quals `thenDs` \ core_rest ->
+ returnDs (mkIfThenElse core_guard core_rest (Var n_id))
-dfListComp c_ty c_id n_ty n_id (LetStmt binds : quals)
+dfListComp c_id n_id (LetStmt binds : quals)
-- new in 1.3, local bindings
- = dsBinds False{-don't auto scc-} binds `thenDs` \ core_binds ->
- dfListComp c_ty c_id n_ty n_id quals `thenDs` \ core_rest ->
- returnDs (mkCoLetsAny core_binds core_rest)
+ = dfListComp c_id n_id quals `thenDs` \ core_rest ->
+ dsLet binds core_rest
-dfListComp c_ty c_id n_ty n_id (BindStmt pat list1 locn : quals)
+dfListComp c_id n_id (BindStmt pat list1 locn : quals)
-- evaluate the two lists
= dsExpr list1 `thenDs` \ core_list1 ->
-- find the required type
-
- let p_ty = outPatType pat
- b_ty = n_ty -- alias b_ty to n_ty
- fn_ty = mkFunTys [p_ty, b_ty] b_ty
- lst_ty = coreExprType core_list1
+ let x_ty = outPatType pat
+ b_ty = idType n_id
in
-- create some new local id's
-
- newSysLocalsDs [b_ty,p_ty,fn_ty,lst_ty] `thenDs` \ [b,p,fn,lst] ->
+ newSysLocalsDs [b_ty,x_ty] `thenDs` \ [b,x] ->
-- build rest of the comprehesion
+ dfListComp c_id b quals `thenDs` \ core_rest ->
- dfListComp c_ty c_id b_ty b quals `thenDs` \ core_rest ->
-- build the pattern match
-
- matchSimply (Var p) pat b_ty core_rest (Var b) `thenDs` \ core_expr ->
+ matchSimply (Var x) ListCompMatch pat core_rest (Var b) `thenDs` \ core_expr ->
-- now build the outermost foldr, and return
-
+ dsLookupGlobalValue foldrName `thenDs` \ foldr_id ->
returnDs (
- mkCoLetsAny
- [NonRec fn (mkValLam [p, b] core_expr),
- NonRec lst core_list1]
- (mkFoldr p_ty n_ty fn n_id lst)
+ Var foldr_id `App` Type x_ty
+ `App` Type b_ty
+ `App` mkLams [x, b] core_expr
+ `App` Var n_id
+ `App` core_list1
)
-
-mkFoldr a b f z xs
- = mkValApp (mkTyApp (Var foldrId) [a,b]) [VarArg f, VarArg z, VarArg xs]
\end{code}
+
+
projects / ghc-hetmet.git / blobdiff