Home My Page Projects Code Snippets Project Openings diderot
 Summary Activity Tracker Tasks SCM

# SCM Repository

[diderot] View of /trunk/src/compiler/simplify/simplify.sml
 [diderot] / trunk / src / compiler / simplify / simplify.sml # View of /trunk/src/compiler/simplify/simplify.sml

Mon Oct 14 09:36:13 2013 UTC (5 years, 5 months ago) by jhr
File size: 13379 byte(s)
```  New SimpleAST representation that uses types with meta-variables
resolved (i.e., removed).
```
```(* simplify.sml
*
* COPYRIGHT (c) 2010 The Diderot Project (http://diderot-language.cs.uchicago.edu)
*
* Simplify the AST representation.
*)

structure Simplify : sig

val transform : Error.err_stream * AST.program -> Simple.program

end = struct

structure TU = TypeUtil
structure S = Simple
structure VMap = Var.Map

val cvtTy = SimpleTypes.simplify

fun newTemp ty = SimpleVar.new ("_t", SimpleVar.LocalVar, ty)

(* convert an AST variable to a Simple variable *)
fun cvtVar (env, x as Var.V{name, kind, ty=([], ty), ...}) = let
val x' = SimpleVar.new (name, kind, cvtTy ty)
in
(x', VMap.insert(env, x, x'))
end

fun cvtVars (env, xs) = List.foldr
(fn (x, (xs, env)) => let
val (x', env) = cvtVar(env, x)
in
(x'::xs, env)
end) ([], env) xs

fun lookupVar (env, x) = (case VMap.find (env, x)
of SOME x' => x'
| NONE => raise Fail(concat["lookupVar(", Var.uniqueNameOf x, ")"])
(* end case *))

(* make a block out of a list of statements that are in reverse order *)
fun mkBlock stms = S.Block(List.rev stms)

(* is the given statement's continuation the syntactically following statement? *)
fun contIsNext (AST.S_Block stms) = List.all contIsNext stms
| contIsNext (AST.S_IfThenElse(_, s1, s2)) = contIsNext s1 orelse contIsNext s2
| contIsNext AST.S_Die = false
| contIsNext AST.S_Stabilize = false
| contIsNext (AST.S_Return _) = false
| contIsNext _ = true

fun simplifyProgram (AST.Program dcls) = let
val globals = ref []
val globalInit = ref []
val funcs = ref []
val initially = ref NONE
val strands = ref []
fun setInitially init = (case !initially
of NONE => initially := SOME init
(* FIXME: the check for multiple initially decls should happen in type checking *)
| SOME _ => raise Fail "multiple initially declarations"
(* end case *))
fun simplifyDecl (dcl, env) = (case dcl
of AST.D_Input(x, desc, NONE) => let
val (x', env) = cvtVar(env, x)
val e' = S.E_Input(SimpleVar.typeOf x', SimpleVar.nameOf x', desc, NONE)
in
globals := x' :: !globals;
globalInit := S.S_Assign(x', e') :: !globalInit;
env
end
| AST.D_Input(x, desc, SOME e) => let
val (x', env) = cvtVar(env, x)
val (stms, x'') = simplifyExpToVar (env, e, [])
val e' = S.E_Input(SimpleVar.typeOf x', SimpleVar.nameOf x', desc, SOME x'')
in
globals := x' :: !globals;
globalInit := S.S_Assign(x', e') :: (stms @ !globalInit);
env
end
| AST.D_Var(AST.VD_Decl(x, e)) => let
val (x', env) = cvtVar(env, x)
val (stms, e') = simplifyExp (env, e, [])
in
globals := x' :: !globals;
globalInit := S.S_Assign(x', e') :: (stms @ !globalInit);
env
end
| AST.D_Func(f, params, body) => let
val (f', env) = cvtVar(env, f)
val (params', env) = cvtVars (env, params)
val body' = simplifyBlock(env, body)
in
funcs := S.Func{f=f', params=params', body=body'} :: !funcs;
env
end
| AST.D_Strand info => (
strands := simplifyStrand(env, info) :: !strands;
env)
| AST.D_InitialArray(creat, iters) => (
setInitially (simplifyInit(env, true, creat, iters));
env)
| AST.D_InitialCollection(creat, iters) => (
setInitially (simplifyInit(env, false, creat, iters));
env)
(* end case *))
val env = List.foldl simplifyDecl VMap.empty dcls
in
S.Program{
globals = List.rev(!globals),
globalInit = mkBlock (!globalInit),
funcs = List.rev(!funcs),
init = (case !initially
(* FIXME: the check for the initially block should really happen in typechecking *)
of NONE => raise Fail "missing initially declaration"
| SOME blk => blk
(* end case *)),
strands = List.rev(!strands)
}
end

and simplifyInit (env, isArray, AST.C_Create(strand, exps), iters) = let
fun simplifyIter (AST.I_Range(x, e1, e2), (env, iters, stms)) = let
val (stms, lo) = simplifyExpToVar (env, e1, stms)
val (stms, hi) = simplifyExpToVar (env, e2, stms)
val (x', env) = cvtVar (env, x)
in
(env, {param=x', lo=lo, hi=hi}::iters, stms)
end
val (env, iters, iterStms) = List.foldl simplifyIter (env, [], []) iters
val (stms, xs) = simplifyExpsToVars (env, exps, [])
val creat = S.C_Create{
argInit = mkBlock stms,
name = strand,
args = xs
}
in
S.Initially{
isArray = isArray,
rangeInit = mkBlock iterStms,
iters = List.rev iters,
create = creat
}
end

and simplifyStrand (env, AST.Strand{name, params, state, methods}) = let
val (params', env) = cvtVars (env, params)
fun simplifyState (env, [], xs, stms) = (List.rev xs, mkBlock stms, env)
| simplifyState (env, AST.VD_Decl(x, e) :: r, xs, stms) = let
val (stms, e') = simplifyExp (env, e, stms)
val (x', env) = cvtVar(env, x)
in
simplifyState (env, r, x'::xs, S.S_Assign(x', e') :: stms)
end
val (xs, stm, env) = simplifyState (env, state, [], [])
in
S.Strand{
name = name,
params = params',
state = xs, stateInit = stm,
methods = List.map (simplifyMethod env) methods
}
end

and simplifyMethod env (AST.M_Method(name, body)) =
S.Method(name, simplifyBlock(env, body))

(* simplify a statement into a single statement (i.e., a block if it expands
* into more than one new statement).
*)
and simplifyBlock (env, stm) = mkBlock (#1 (simplifyStmt (env, stm, [])))

(* simplify the statement stm where stms is a reverse-order list of preceeding simplified
* statements.  This function returns a reverse-order list of simplified statements.
* Note that error reporting is done in the typechecker, but it does not prune unreachable
* code.
*)
and simplifyStmt (env, stm, stms) = (case stm
of AST.S_Block body => let
fun simplify (_, [], stms) = stms
| simplify (env', stm::r, stms) = let
val (stms, env') = simplifyStmt (env', stm, stms)
in
if contIsNext stm
then simplify (env', r, stms)
else stms  (* prune the unreachable statements "r" *)
end
in
(simplify (env, body, stms), env)
end
| AST.S_Decl(AST.VD_Decl(x, e)) => let
val (stms, e') = simplifyExp (env, e, stms)
val (x', env) = cvtVar(env, x)
in
(S.S_Assign(x', e') :: stms, env)
end
| AST.S_IfThenElse(e, s1, s2) => let
val (stms, x) = simplifyExpToVar (env, e, stms)
val s1 = simplifyBlock (env, s1)
val s2 = simplifyBlock (env, s2)
in
(S.S_IfThenElse(x, s1, s2) :: stms, env)
end
| AST.S_Assign(x, e) => let
val (stms, e') = simplifyExp (env, e, stms)
in
(S.S_Assign(lookupVar(env, x), e') :: stms, env)
end
| AST.S_New(name, args) => let
val (stms, xs) = simplifyExpsToVars (env, args, stms)
in
(S.S_New(name, xs) :: stms, env)
end
| AST.S_Die => (S.S_Die :: stms, env)
| AST.S_Stabilize => (S.S_Stabilize :: stms, env)
| AST.S_Return e => let
val (stms, x) = simplifyExpToVar (env, e, stms)
in
(S.S_Return x :: stms, env)
end
| AST.S_Print args => let
val (stms, xs) = simplifyExpsToVars (env, args, stms)
in
(S.S_Print xs :: stms, env)
end
(* end case *))

and simplifyExp (env, exp, stms) = (
case exp
of AST.E_Var x => (case Var.kindOf x
of Var.BasisVar => let
val ty = cvtTy(Var.monoTypeOf x)
val x' = newTemp ty
val stm = S.S_Assign(x', S.E_Prim(x, [], [], ty))
in
(stm::stms, S.E_Var x')
end
| _ => (stms, S.E_Var(lookupVar(env, x)))
(* end case *))
| AST.E_Lit lit => (stms, S.E_Lit lit)
| AST.E_Tuple es => raise Fail "E_Tuple not yet implemented"
| AST.E_Apply(f, tyArgs, args, ty) => let
val (stms, xs) = simplifyExpsToVars (env, args, stms)
in
case Var.kindOf f
of S.FunVar => (stms, S.E_Apply(lookupVar(env, f), xs, cvtTy ty))
| S.BasisVar => let
fun cvtTyArg (Types.TYPE tv) = S.TY(cvtTy(TU.resolve tv))
| cvtTyArg (Types.DIFF dv) = S.DIFF(TU.monoDiff(TU.resolveDiff dv))
| cvtTyArg (Types.SHAPE sv) = S.SHAPE(TU.monoShape(TU.resolveShape sv))
| cvtTyArg (Types.DIM dv) = S.DIM(TU.monoDim(TU.resolveDim dv))
val tyArgs = List.map cvtTyArg tyArgs
in
(stms, S.E_Prim(f, tyArgs, xs, cvtTy ty))
end
| _ => raise Fail "bogus application"
(* end case *)
end
| AST.E_Cons es => let
val (stms, xs) = simplifyExpsToVars (env, es, stms)
in
(stms, S.E_Cons xs)
end
| AST.E_Slice(e, indices, ty) => let (* tensor slicing *)
val (stms, x) = simplifyExpToVar (env, e, stms)
fun f ([], ys, stms) = (stms, List.rev ys)
| f (NONE::es, ys, stms) = f (es, NONE::ys, stms)
| f (SOME e::es, ys, stms) = let
val (stms, y) = simplifyExpToVar (env, e, stms)
in
f (es, SOME y::ys, stms)
end
val (stms, indices) = f (indices, [], stms)
in
(stms, S.E_Slice(x, indices, cvtTy ty))
end
| AST.E_Cond(e1, e2, e3, ty) => let
(* a conditional expression gets turned into an if-then-else statememt *)
val result = newTemp(cvtTy ty)
val (stms, x) = simplifyExpToVar (env, e1, S.S_Var result :: stms)
fun simplifyBranch e = let
val (stms, e) = simplifyExp (env, e, [])
in
mkBlock (S.S_Assign(result, e)::stms)
end
val s1 = simplifyBranch e2
val s2 = simplifyBranch e3
in
(S.S_IfThenElse(x, s1, s2) :: stms, S.E_Var result)
end
| AST.E_Coerce{srcTy, dstTy, e} => let
val (stms, x) = simplifyExpToVar (env, e, stms)
val dstTy = cvtTy dstTy
val result = newTemp dstTy
val rhs = S.E_Coerce{srcTy = cvtTy srcTy, dstTy = dstTy, x = x}
in
(S.S_Assign(result, rhs)::stms, S.E_Var result)
end
(* end case *))

and simplifyExpToVar (env, exp, stms) = let
val (stms, e) = simplifyExp (env, exp, stms)
in
case e
of S.E_Var x => (stms, x)
| _ => let
val x = newTemp (S.typeOf e)
in
(S.S_Assign(x, e)::stms, x)
end
(* end case *)
end

and simplifyExpsToVars (env, exps, stms) = let
fun f ([], xs, stms) = (stms, List.rev xs)
| f (e::es, xs, stms) = let
val (stms, x) = simplifyExpToVar (env, e, stms)
in
f (es, x::xs, stms)
end
in
f (exps, [], stms)
end

fun transform (errStrm, ast) = let
val simple = simplifyProgram ast
val _ = SimplePP.output (Log.logFile(), "simplify", simple)   (* DEBUG *)
val simple = Inliner.transform simple
val _ = SimplePP.output (Log.logFile(), "inlining", simple)   (* DEBUG *)
val simple = Lift.transform simple
handle Eval.Error msg => (Error.error(errStrm, msg); simple)
val _ = SimplePP.output (Log.logFile(), "lifting", simple)   (* DEBUG *)
in
simple
end

end
```

 root@smlnj-gforge.cs.uchicago.edu ViewVC Help Powered by ViewVC 1.0.0