protected StmtBlock HandleBlock(StmtBlock s, Func <Stmt, Stmt> fn)
{
var stNew = this.HandleList(s.Statements, fn);
if (stNew == null)
{
return(s);
}
else
{
var blocks = stNew.SelectMany(x => {
if (x == null)
{
return(Enumerable.Empty <Stmt>());
}
if (x.StmtType == Stmt.NodeType.Block)
{
return(((StmtBlock)x).Statements);
}
else
{
return(new[] { x });
}
})
.ToArray();
return(new StmtBlock(s.Ctx, blocks));
}
}
internal SequenceStmt ParseSequenceStmt()
{
Require(TokenType.BEGIN);
var t = RequireAndGet(TokenType.SEQUENCE);
Require(TokenType.EOS);
var s = ParseStatementBlock();
Token n = null;
StmtBlock r = null;
if (Expect(TokenType.RECOVER))
{
Require(TokenType.USING);
n = RequireIdName();
Require(TokenType.EOS);
r = ParseStatementBlock();
}
StmtBlock f = null;
if (Expect(TokenType.FINALLY))
{
Require(TokenType.EOS);
f = ParseStatementBlock();
}
Require(TokenType.END);
Expect(TokenType.SEQUENCE);
Require(TokenType.EOS);
return(new SequenceStmt(t, s, n, r, f));
}
protected override ICode VisitBlock(StmtBlock s)
{
foreach (var stmt in s.Statements)
{
this.Visit(stmt);
}
return(s);
}
protected override ICode VisitDoLoop(StmtDoLoop s)
{
var body = (Stmt)this.Visit(s.Body);
StmtIf lastIf = null;
IEnumerable <Stmt> preIf = null;
if (body.StmtType == Stmt.NodeType.Block)
{
var sBlock = (StmtBlock)body;
if (sBlock.Statements.Any())
{
var sLast = sBlock.Statements.Last();
if (sLast.StmtType == Stmt.NodeType.If)
{
lastIf = (StmtIf)sLast;
preIf = sBlock.Statements.Take(sBlock.Statements.Count() - 1).ToArray();
}
}
}
else if (body.StmtType == Stmt.NodeType.If)
{
lastIf = (StmtIf)body;
preIf = Enumerable.Empty <Stmt>();
}
if (lastIf != null)
{
Stmt afterLoop = null;
StmtIf newIf = null;
// See if final 'if' condition is same as the 'do' condition.
// TODO: This may lead to a non-terminating situation...
if (lastIf.Condition.DoesEqual(s.While))
{
afterLoop = lastIf.Else;
newIf = new StmtIf(s.Ctx, lastIf.Condition, lastIf.Then, null);
}
else if (lastIf.Condition.DoesEqualNot(s.While))
{
afterLoop = lastIf.Then;
newIf = new StmtIf(s.Ctx, lastIf.Condition, null, lastIf.Else);
}
if (afterLoop != null)
{
var loopBody = new StmtBlock(s.Ctx, preIf.Concat(newIf));
var loop = new StmtDoLoop(s.Ctx, loopBody, s.While);
var ret = new StmtBlock(s.Ctx, loop, afterLoop);
return(ret);
}
}
if (body != s.Body)
{
return(new StmtDoLoop(s.Ctx, body, s.While));
}
else
{
return(s);
}
}
protected override ICode VisitBlock(StmtBlock s)
{
var statements = s.Statements
.Select(x => (Stmt)this.Visit(x))
.Where(x => x != null)
.ToArray();
var stNew = statements.Combine((a, b) => {
if (a.StmtType == Stmt.NodeType.If && b.StmtType == Stmt.NodeType.If)
{
var aIf = (StmtIf)a;
var bIf = (StmtIf)b;
if (aIf.Then.StmtType != Stmt.NodeType.Continuation && bIf.Then.StmtType != Stmt.NodeType.Continuation)
{
// Join adjacent 'if' statements if possible. Do not do if both 'if' statements only contain
// continuations, so as not to mess up the if-distribution
if (aIf.Condition.DoesEqual(bIf.Condition))
{
return(new StmtIf(s.Ctx, aIf.Condition,
new StmtBlock(s.Ctx, aIf.Then, bIf.Then),
new StmtBlock(s.Ctx, aIf.Else, bIf.Else)));
}
else if (aIf.Condition.DoesEqualNot(bIf.Condition))
{
return(new StmtIf(s.Ctx, aIf.Condition,
new StmtBlock(s.Ctx, aIf.Then, bIf.Else),
new StmtBlock(s.Ctx, aIf.Else, bIf.Then)));
}
}
if (aIf.Then.DoesEqual(bIf.Then) && aIf.Else.DoesEqual(bIf.Else))
{
// Both 'if' statements contain the same bodies, so 'or' conditions together
return(new StmtIf(s.Ctx, s.Ctx.ExprGen.Or(aIf.Condition, bIf.Condition), aIf.Then, aIf.Else));
}
}
else if (a.StmtType == Stmt.NodeType.If && b.StmtType == Stmt.NodeType.Continuation)
{
var aIf = (StmtIf)a;
if (aIf.Then.DoesEqual(b) || aIf.Else.DoesEqual(b))
{
return(b);
}
}
return(null);
}).ToArray();
if (!Enumerable.SequenceEqual(s.Statements, stNew))
{
return(new StmtBlock(s.Ctx, stNew));
}
else
{
return(s);
}
}
public static Stmt get_Value(Ctx ctx)
{
var excCtor = ctx.Module.Import(typeof(InvalidOperationException).GetConstructor(Type.EmptyTypes));
var invalidOperationException = new ExprNewObj(ctx, excCtor);
var throwInvalidOperationException = new StmtThrow(ctx, invalidOperationException);
var cond = new ExprJsExplicit(ctx, "(this === null)", ctx.Boolean, ctx.ThisNamed);
var throwIf = new StmtIf(ctx, cond, throwInvalidOperationException, null);
var ret = new StmtReturn(ctx, ctx.This);
var stmt = new StmtBlock(ctx, throwIf, ret);
return(stmt);
}
private StmtBlock ParseStmtBlock(CodePosition startPosition)
{
StmtBlock stmtBlock = new StmtBlock();
while (tape.Current.Col > startPosition.Col)
{
Stmt stmt = ParseStmt();
if (stmt != null)
{
stmtBlock.StmtList.Add(stmt);
}
}
return(stmtBlock);
}
protected override ICode VisitBlock(StmtBlock s)
{
var count = s.Statements.Count();
if (count == 0)
{
return(null);
}
if (count == 1)
{
return(this.Visit(s.Statements.First()));
}
return(base.VisitBlock(s));
}
protected override ICode VisitBlock(StmtBlock s)
{
var ctx = s.Ctx;
var sBlock = (StmtBlock)base.VisitBlock(s);
var assignments = sBlock.Statements
.SelectMany(x => this.ensureAssigned.ValueOrDefault(this.stmtMap.ValueOrDefault(x, x), Enumerable.Empty <ExprVar>()))
.ToArray();
if (assignments.Any())
{
var assignmentStmts = assignments
.Select(x => new StmtAssignment(ctx, x, new ExprDefaultValue(ctx, x.Type)))
.ToArray();
return(new StmtBlock(ctx, assignmentStmts.Concat(sBlock.Statements)));
}
else
{
return(sBlock);
}
}
protected override ICode VisitBlock(StmtBlock s)
{
bool restGone = false;
// Remove all code after an infinite loop
return(this.HandleBlock(s, stmt => {
if (restGone)
{
return null;
}
if (stmt.StmtType == Stmt.NodeType.DoLoop)
{
var sDo = (StmtDoLoop)stmt;
if (sDo.While.IsLiteralBoolean(true))
{
restGone = true;
}
}
return stmt;
}));
}
protected override ICode VisitDoLoop(StmtDoLoop s)
{
var ctx = s.Ctx;
var body = (Stmt)this.Visit(s.Body);
var @while = (Expr)this.Visit(s.While);
var conditionVars = VisitorFindVars.V(@while);
var needAssigning = conditionVars.Except(this.stack.SelectMany(x => x), (IEqualityComparer <ExprVar>) this.phiComparer).ToArray();
if (needAssigning.Any())
{
var replacements = needAssigning.Select(x => {
var newExpr = ctx.Local(x.Type);
var phi = new ExprVarPhi(ctx)
{
Exprs = new[] { x, newExpr }
};
return(new { orgExpr = x, newExpr, phi });
}).ToArray();
foreach (var replace in replacements)
{
this.stack.Peek().Add(replace.newExpr);
this.stack.Peek().Add(replace.phi);
@while = (Expr)VisitorReplace.V(@while, replace.orgExpr, replace.phi);
}
var assignmentStmts = replacements
.Select(x => new StmtAssignment(ctx, x.newExpr, new ExprDefaultValue(ctx, x.newExpr.Type)))
.ToArray();
body = new StmtBlock(ctx, assignmentStmts.Concat(body));
}
if (body != s.Body || @while != s.While)
{
return(new StmtDoLoop(ctx, body, @while));
}
else
{
return(s);
}
}
public static JsResult CreateFrom(IEnumerable <MethodReference> rootMethods, bool verbose = false, bool testing = false)
{
var todo = new Queue <MethodReference>();
foreach (var method in rootMethods)
{
todo.Enqueue(method);
}
Action <MethodReference> addTodo = m => {
if (m.ContainsGenericParameters())
{
throw new Exception("Cannot add todo method with generic parameters");
}
todo.Enqueue(m);
};
// Each method, with the count of how often it is referenced.
var methodsSeen = new Dictionary <MethodReference, int>(rootMethods.ToDictionary(x => x, x => 1), TypeExtensions.MethodRefEqComparerInstance);
// Each type, with the count of how often it is referenced directly (newobj only at the moment).
var typesSeen = new Dictionary <TypeReference, int>(TypeExtensions.TypeRefEqComparerInstance);
// ASTs of all methods
var methodAsts = new Dictionary <MethodReference, ICode>(TypeExtensions.MethodRefEqComparerInstance);
// Each field, with the count of how often it is referenced.
var fieldAccesses = new Dictionary <FieldReference, int>(TypeExtensions.FieldReqEqComparerInstance);
// Each type records which virtual methods have their NewSlot definitions
var virtualCalls = new Dictionary <TypeReference, HashSet <MethodReference> >(TypeExtensions.TypeRefEqComparerInstance);
// Each basemost virtual method records the least-derived type actually called
// This allows only virtual methods in more-derived types to be transcoded
var virtualCallExactMethods = new Dictionary <MethodReference, IEnumerable <TypeReference> >(TypeExtensions.MethodRefEqComparerInstance);
// Each interface type records which interface methods are called
var interfaceCalls = new Dictionary <TypeReference, HashSet <MethodReference> >(TypeExtensions.TypeRefEqComparerInstance);
// All instance constructors must be updated after all methods have been processed, to initialise all referenced
// instance fields in the type, and to sort out 'return' statements.
// This has to be done later, so the list of referenced fields in complete
var instanceConstructors = new List <Ctx>();
while (todo.Any())
{
// TODO: parallelise
var mRef = todo.Dequeue();
var mDef = mRef.Resolve();
var tRef = mRef.DeclaringType;
var tDef = tRef.Resolve();
var ctx = new Ctx(tRef, mRef);
var ast = (ICode)JsResolver.ResolveMethod(ctx);
if (ast == null)
{
var transcodeCtx = JsResolver.TranslateCtx(ctx) ?? ctx;
if (transcodeCtx.MRef.ContainsGenericParameters())
{
throw new InvalidOperationException("Method/type must not have generic parameters");
}
if (transcodeCtx.MDef.IsAbstract)
{
throw new InvalidOperationException("Cannot transcode an abstract method");
}
if (transcodeCtx.MDef.IsInternalCall)
{
throw new InvalidOperationException("Cannot transcode an internal call");
}
if (transcodeCtx.MDef.IsExternal())
{
throw new InvalidOperationException("Cannot transcode an external method");
}
if (!transcodeCtx.MDef.HasBody)
{
throw new InvalidOperationException("Cannot transcode method without body");
}
if (!typesSeen.ContainsKey(tRef))
{
typesSeen.Add(tRef, 0);
}
ast = Transcoder.ToAst(transcodeCtx, verbose);
}
for (int i = 0; ; i++)
{
var astOrg = ast;
ast = Transcoder.DoStep(s => (Stmt)VisitorJsRewriteSealedVCalls.V(s), (Stmt)ast, "VisitorJsRewriteSealedVCalls", verbose);
ast = Transcoder.DoStep(s => (Stmt)VisitorJsResolveAll.V(s), (Stmt)ast, "VisitorJsResolveAll", verbose);
ast = Transcoder.DoStep(s => (Stmt)VisitorJsResolveConv.V(s), (Stmt)ast, "VisitorJsResolveConv", verbose);
ast = Transcoder.DoStep(s => (Stmt)VisitorJsResolveSpecialTypes.V(s), (Stmt)ast, "VisitorJsResolveSpecialTypes", verbose);
ast = Transcoder.DoStep(s => (Stmt)VisitorJsResolveDelegates.V(s), (Stmt)ast, "VisitorJsResolveDelegates", verbose);
// 64bit must be after everything else
ast = Transcoder.DoStep(s => (Stmt)VisitorJsResolve64Bit.V(s), (Stmt)ast, "VisitorJsResolve64Bit", verbose);
if (ast == astOrg)
{
break;
}
if (i > 10)
{
// After 10 iterations even the most complex method should be sorted out
throw new InvalidOperationException("Error: Stuck in loop trying to resolve AST");
}
}
ast = Transcoder.DoStep(s => (Stmt)VisitorJsResolveValueTypes.V(s), (Stmt)ast, "VisitorJsResolveValueTypes", verbose);
ast = Transcoder.DoStep(s => (Stmt)VisitorIfSimplification.V(s), (Stmt)ast, "VisitorIfSimplification", verbose);
ast = Transcoder.DoStep(s => (Stmt)VisitorJsResolveByRefParameters.V(s), (Stmt)ast, "VisitorJsResolveByRefParameters", verbose);
if (mDef.IsVirtual && mRef.DeclaringType.IsValueType)
{
// 'this' may be boxed or unboxed. Must be unboxed if boxed
// This is required because in real .NET the boxed and unboxed versions are both directly
// available at the this reference; this is not the case in the JS emulation of boxing
var unbox = new StmtJsExplicit(ctx, "if (this._) this = this.v;", ctx.ThisNamed);
ast = new StmtBlock(ctx, unbox, (Stmt)ast);
Transcoder.Print((Stmt)ast, "Unbox-this", verbose);
}
if (mDef.IsConstructor && !mDef.IsStatic)
{
// Instance constructor; add instance field initialisation and final return of 'this' later
instanceConstructors.Add(ctx);
}
var cctors = VisitorFindStaticConstructors.V(ast)
.Where(x => !TypeExtensions.MethodRefEqComparerInstance.Equals(x, mRef))
.Distinct(TypeExtensions.MethodRefEqComparerInstance)
.ToArray();
if (cctors.Any())
{
// All methods that access static fields or methods must call the static constructor at the very
// start of the method. Except the static construtor itself, which must not recurse into itself.
var cctorCalls = cctors
.Select(x => new StmtWrapExpr(ctx, new ExprCall(ctx, x, null, Enumerable.Empty <Expr>(), false))).ToArray();
ast = new StmtBlock(ctx, cctorCalls.Concat((Stmt)ast));
Transcoder.Print((Stmt)ast, "Call-cctors", verbose);
}
if (mDef.IsConstructor && mDef.IsStatic)
{
// At the beginning of the static constructor, it rewrites itself as an empty function, so it is only called once.
var rewrite = new StmtAssignment(ctx, new ExprJsVarMethodReference(ctx, mRef), new ExprJsEmptyFunction(ctx));
ast = new StmtBlock(ctx, rewrite, (Stmt)ast);
Transcoder.Print((Stmt)ast, "cctor-once-only", verbose);
}
methodAsts.Add(mRef, ast);
var fieldRefs = VisitorFindFieldAccesses.V(ast);
foreach (var fieldRef in fieldRefs)
{
fieldAccesses[fieldRef] = fieldAccesses.ValueOrDefault(fieldRef) + 1;
}
var arrayRefs = VisitorFindNewArrays.V(ast);
foreach (var arrayRef in arrayRefs)
{
typesSeen[arrayRef] = typesSeen.ValueOrDefault(arrayRef) + 1;
}
var types = VisitorFindRequiredTypes.V(ast);
foreach (var type in types)
{
typesSeen[type] = typesSeen.ValueOrDefault(type) + 1;
}
if (mDef.GetCustomAttribute <JsReturnTypeDeepUseAttribute>(true) != null)
{
var retType = mDef.ReturnType.FullResolve(ctx);
var retTypes = retType.EnumThisAllContainedTypes().ToArray();
foreach (var type in retTypes)
{
typesSeen[type] = typesSeen.ValueOrDefault(type) + 1;
if (type.IsGenericInstance && type.Resolve().FullName == "System.Collections.Generic.Dictionary`2")
{
// HACK - ensure no-arg ctor is present. JSON needs it
var ctor = type.EnumResolvedMethods().First(x => x.Name == ".ctor" && !x.HasParameters);
if (!methodsSeen.ContainsKey(ctor))
{
methodsSeen.Add(ctor, 1);
addTodo(ctor);
}
// HACK - ensure Add(key, value) method present. JSON need sit
var mAdd = type.EnumResolvedMethods().First(x => x.Name == "Add");
if (!methodsSeen.ContainsKey(mAdd))
{
methodsSeen.Add(mAdd, 1);
addTodo(mAdd);
}
}
}
}
var calledMethods = new List <ICall>();
var calls = VisitorFindCalls.V(ast);
foreach (var call in calls.Where(x => x.ExprType == Expr.NodeType.NewObj || x.IsVirtualCall))
{
// Add reference to each type constructed (direct access to type variable)
typesSeen[call.Type] = typesSeen.ValueOrDefault(call.Type) + 1;
}
foreach (var call in calls)
{
if (call.CallMethod.DeclaringType.Resolve().IsInterface)
{
var methodSet = interfaceCalls.ValueOrDefault(call.CallMethod.DeclaringType, () => new HashSet <MethodReference>(TypeExtensions.MethodRefEqComparerInstance), true);
methodSet.Add(call.CallMethod);
// Methods that require transcoding are added to 'todo' later
continue;
}
if (call.IsVirtualCall)
{
var mBasemost = call.CallMethod.GetBasemostMethod(null);
var methodSet = virtualCalls.ValueOrDefault(mBasemost.DeclaringType, () => new HashSet <MethodReference>(TypeExtensions.MethodRefEqComparerInstance), true);
methodSet.Add(mBasemost);
var objType = call.Obj.Type;
var already = virtualCallExactMethods.ValueOrDefault(mBasemost).EmptyIfNull();
if (!already.Any(x => x.IsBaseOfOrEqual(objType)))
{
virtualCallExactMethods[mBasemost] = already.Concat(objType).ToArray();
}
// Methods that require transcoding are added to 'todo' later
continue;
}
calledMethods.Add(call);
}
foreach (var call in calledMethods)
{
if (methodsSeen.ContainsKey(call.CallMethod))
{
methodsSeen[call.CallMethod]++;
}
else
{
methodsSeen.Add(call.CallMethod, 1);
//todo.Enqueue(call.CallMethod);
addTodo(call.CallMethod);
}
}
if (!todo.Any())
{
// Add System.RuntimeType if any types have been seen
if (typesSeen.Any(x => x.Value > 0) && !typesSeen.Any(x => x.Key.FullName == "System.RuntimeType"))
{
var runtimeType = ctx.Module.Import(Type.GetType("System.RuntimeType"));
typesSeen.Add(runtimeType, 1);
}
// Scan all virtual calls and add any required methods
// Need care to handle virtual methods with generic arguments
var virtualRoots = new HashSet <MethodReference>(virtualCalls.SelectMany(x => x.Value), TypeExtensions.MethodRefEqComparerInstance);
var requireMethods =
from type in typesSeen.Keys
//let typeReverseMapped = JsResolver.ReverseTypeMap(type)
let typeAndBases = type.EnumThisAllBaseTypes().ToArray()
let mVRoots = typeAndBases.SelectMany(x => virtualCalls.ValueOrDefault(x).EmptyIfNull()).ToArray()
let methods = type.EnumResolvedMethods(mVRoots).ToArray()
from method in methods //.Select(x => JsResolver.ResolveMethod(x))
let methodDef = method.Resolve()
where methodDef != null // HACK?
where !methodDef.IsStatic && methodDef.IsVirtual && !methodDef.IsAbstract
where !methodsSeen.ContainsKey(method)
let mBasemost = method.GetBasemostMethod(method)
where virtualCallExactMethods.ValueOrDefault(mBasemost).EmptyIfNull().Any(x => {
//return x.IsBaseOfOrEqual(typeReverseMapped) || typeReverseMapped.IsBaseOfOrEqual(x);
return(x.IsBaseOfOrEqual(type) || type.IsBaseOfOrEqual(x));
})
where virtualRoots.Contains(mBasemost)
select method;
var requireMethodsArray = requireMethods.Distinct(TypeExtensions.MethodRefEqComparerInstance).ToArray();
foreach (var method in requireMethodsArray)
{
methodsSeen.Add(method, 1); // TODO: How to properly handle count?
//todo.Enqueue(method);
addTodo(method);
}
// Scan all interface calls and add any required methods
var iFaceMethods =
from type in typesSeen.Keys
from iFace in interfaceCalls
let iFaceType = iFace.Key
let typeAndBases = type.EnumThisAllBaseTypes().ToArray()
where typeAndBases.Any(x => x.DoesImplement(iFaceType))
let methods = typeAndBases.SelectMany(x => x.EnumResolvedMethods(iFace.Value)).ToArray()
from method in methods//.Select(x => JsResolver.ResolveMethod(x))
where !methodsSeen.ContainsKey(method)
let methodDef = method.Resolve()
where methodDef != null // HACK?
where !methodDef.IsStatic && methodDef.IsVirtual && !methodDef.IsAbstract
from iFaceMethod in iFace.Value
where method.IsImplementationOf(iFaceMethod)
select method;
var iFaceMethodsArray = iFaceMethods.Distinct(TypeExtensions.MethodRefEqComparerInstance).ToArray();
foreach (var method in iFaceMethodsArray)
{
methodsSeen.Add(method, 1);
addTodo(method);
//todo.Enqueue(method);
}
}
}
// Add type count to System.RuntimeType
var runtimeTypeInc = typesSeen.Keys.FirstOrDefault(x => x.FullName == "System.RuntimeType");
if (runtimeTypeInc != null)
{
typesSeen[runtimeTypeInc] += 2;
}
var instanceFieldsByType = fieldAccesses
.Where(x => !x.Key.Resolve().IsStatic)
.ToLookup(x => x.Key.DeclaringType.FullResolve(x.Key), TypeExtensions.TypeRefEqComparerInstance);
// Update all instance constructors to initialise instance fields, add final 'return' statement,
// and update any early returns to return 'this'
foreach (var ctx in instanceConstructors)
{
var fields = instanceFieldsByType[ctx.TRef].Select(x => x.Key);
var initStmts = fields.Select(x => {
var f = x.FullResolve(ctx.TRef, ctx.MRef);
var assign = new StmtAssignment(ctx,
new ExprFieldAccess(ctx, ctx.This, f),
new ExprDefaultValue(ctx, f.FieldType));
return(assign);
}).ToArray();
var returnStmt = new StmtReturn(ctx, ctx.This);
var ast = methodAsts[ctx.MRef];
ast = new StmtBlock(ctx, initStmts.Concat((Stmt)ast).Concat(returnStmt));
ast = VisitorJsReturnThis.V(ast, ctx.This);
methodAsts[ctx.MRef] = ast;
}
// Locally name all instance fields; base type names must not be re-used in derived types
var instanceFieldsIndexed = new Dictionary <int, Tuple <IEnumerable <FieldReference>, int> >(); // <index, Tuple<all fields, total use count>>
instanceFieldsByType.TypeTreeTraverse(x => x.Key, (fields, idx) => {
var ordered = fields.OrderByDescending(x => x.Value).ToArray(); // Order by usage count, highest first
foreach (var field in ordered)
{
var idxInfo = instanceFieldsIndexed.ValueOrDefault(idx, () => Tuple.Create(Enumerable.Empty <FieldReference>(), 0));
var newIdxInfo = Tuple.Create((IEnumerable <FieldReference>)idxInfo.Item1.Concat(field.Key).ToArray(), idxInfo.Item2 + field.Value);
instanceFieldsIndexed[idx] = newIdxInfo;
idx++;
}
return(idx);
}, 0);
var orderedInstanceFields = instanceFieldsIndexed.OrderByDescending(x => x.Value.Item2).ToArray();
var instanceFieldNameGen = new NameGenerator();
var instanceFieldNames = orderedInstanceFields
.Select(x => new { name = instanceFieldNameGen.GetNewName(), fields = x.Value.Item1 })
.SelectMany(x => x.fields.Select(y => new { f = y, name = x.name }))
.ToArray();
// Prepare list of static fields for global naming
var staticFields = fieldAccesses.Where(x => x.Key.Resolve().IsStatic).ToArray();
// Prepare local variables for global naming.
// All locals in all methods are sorted by usage count, then all methods usage counts are combined
var clusters = methodAsts.Values.SelectMany(x => VisitorJsPhiClusters.V(x).Select(y => new ExprVarCluster(y))).ToArray();
var varToCluster = clusters.SelectMany(x => x.Vars.Select(y => new { cluster = x, var = y })).ToDictionary(x => x.var, x => x.cluster);
var varsWithCount = methodAsts.Values.Select(x => {
var methodVars = VisitorFindVars.V(x);
// Parameters need one extra count, as they appear in the method declaration
methodVars = methodVars.Concat(methodVars.Where(y => y.ExprType == Expr.NodeType.VarParameter).Distinct());
var ret = methodVars.Select(y => varToCluster.ValueOrDefault(y) ?? y)
.GroupBy(y => y)
.Select(y => new { var = y.Key, count = y.Count() })
.OrderByDescending(y => y.count)
.ToArray();
return(ret);
}).ToArray();
var localVarCounts = new Dictionary <int, int>();
foreach (var x in varsWithCount)
{
for (int i = 0; i < x.Length; i++)
{
localVarCounts[i] = localVarCounts.ValueOrDefault(i) + x[i].count;
}
}
// Globally name all items that require names
var needNaming =
localVarCounts.Select(x => new { item = (object)x.Key, count = x.Value })
.Concat(methodsSeen.Select(x => new { item = (object)x.Key, count = x.Value }))
.Concat(staticFields.Select(x => new { item = (object)x.Key, count = x.Value }))
.Concat(typesSeen.Select(x => new { item = (object)x.Key, count = x.Value }))
.Where(x => x.count > 0)
.OrderByDescending(x => x.count)
.ToArray();
var nameGen = new NameGenerator();
var globalNames = needNaming.ToDictionary(x => x.item, x => nameGen.GetNewName());
// Create map of all local variables to their names
var localVarNames = varsWithCount.Select(x => x.Select((y, i) => new { y.var, name = globalNames[i] }))
.SelectMany(x => x)
.SelectMany(x => {
var varCluster = x.var as ExprVarCluster;
if (varCluster != null)
{
return(varCluster.Vars.Select(y => new { var = y, name = x.name }));
}
else
{
return(new[] { x });
}
})
.ToDictionary(x => x.var, x => x.name);
// Create map of all method names
var methodNames = methodsSeen.Keys.ToDictionary(x => x, x => globalNames[x], TypeExtensions.MethodRefEqComparerInstance);
// Create list of all static field names
var staticFieldNames = staticFields.Select(x => new { f = x.Key, name = globalNames[x.Key] });
// Create map of all fields
if (testing)
{
instanceFieldNames = instanceFieldNames.Select(x => {
switch (x.f.FullName)
{
case "System.String System.Exception::_message":
return(new { x.f, name = "$$_message" });
}
return(x);
}).ToArray();
}
var fieldNames = instanceFieldNames.Concat(staticFieldNames).ToDictionary(x => x.f, x => x.name, TypeExtensions.FieldReqEqComparerInstance);
// Create map of type names
var typeNames = typesSeen
.Where(x => x.Value > 0)
.ToDictionary(x => x.Key, x => globalNames[x.Key], TypeExtensions.TypeRefEqComparerInstance);
// Create virtual call tables
var virtualCallIndices = new Dictionary <MethodReference, int>(TypeExtensions.MethodRefEqComparerInstance);
var allVirtualMethods = new Dictionary <TypeReference, HashSet <MethodReference> >(TypeExtensions.TypeRefEqComparerInstance);
typesSeen.Select(x => x.Key).TypeTreeTraverse(x => x, (type, vCalls) => {
var mNewSlots = virtualCalls.ValueOrDefault(type).EmptyIfNull().ToArray();
int idx = vCalls.Length;
foreach (var mNewSlot in mNewSlots)
{
virtualCallIndices[mNewSlot] = idx++;
}
var vCallsWithThisType = vCalls.Concat(mNewSlots).ToArray();
if (vCallsWithThisType.Length > 0)
{
var typesAndBases = type.EnumThisAllBaseTypes().ToArray();
var mVRoots = typesAndBases.SelectMany(x => virtualCalls.ValueOrDefault(x).EmptyIfNull()).ToArray();
var ms = type.EnumResolvedMethods(mVRoots).ToArray();
for (int i = 0; i < vCalls.Length; i++)
{
var mVCall = vCallsWithThisType[i];
foreach (var m in ms)
{
if (m.MatchMethodOnly(mVCall))
{
vCallsWithThisType[i] = m;
}
}
}
var typeVMethods = new HashSet <MethodReference>(vCallsWithThisType, TypeExtensions.MethodRefEqComparerInstance);
allVirtualMethods.Add(type, typeVMethods);
}
return(vCallsWithThisType);
}, new MethodReference[0]);
var typeData = Enum.GetValues(typeof(TypeData)).Cast <TypeData>().ToArray();
// Name all items that are within the type information
var needTypeInformationNaming =
interfaceCalls.Select(x => new { item = (object)x.Key, count = 1 })
.Concat(typeData.Select(x => new { item = (object)x, count = 1 }))
.OrderByDescending(x => x.count)
.ToArray();
var typeInformationNameGen = new NameGenerator();
var typeInformationNames = needTypeInformationNaming.ToDictionary(x => x.item, x => typeInformationNameGen.GetNewName());
if (testing)
{
typeInformationNames[TypeData.Name] = "$$TypeName";
typeInformationNames[TypeData.Namespace] = "$$TypeNamespace";
}
// Create map of interfaces to their names
var interfaceNames = interfaceCalls.Keys.ToDictionary(x => x, x => typeInformationNames[x], TypeExtensions.TypeRefEqComparerInstance);
var interfaceCallIndices = interfaceCalls.SelectMany(x => x.Value.Select((m, i) => new { m, i })).ToDictionary(x => x.m, x => x.i, TypeExtensions.MethodRefEqComparerInstance);
// Create map of type data constants
var typeDataNames = typeData.ToDictionary(x => x, x => typeInformationNames[x]);
var resolver = new JsMethod.Resolver {
LocalVarNames = localVarNames,
MethodNames = methodNames,
FieldNames = fieldNames,
TypeNames = typeNames,
VirtualCallIndices = virtualCallIndices,
InterfaceCallIndices = interfaceCallIndices,
InterfaceNames = interfaceNames,
TypeDataNames = typeDataNames,
};
var js = new StringBuilder();
js.Append("(function(){");
int jsIndent = 1;
Action jsNewLine = () => {
js.AppendLine();
js.Append(' ', jsIndent * JsMethod.tabSize);
};
jsNewLine();
js.Append("\"use strict\";");
jsNewLine();
// Construct methods
foreach (var methodInfo in methodAsts)
{
var mRef = methodInfo.Key;
var ast = methodInfo.Value;
var mJs = JsMethod.Create(mRef, resolver, ast);
var mJsLines = mJs.Split(new[] { Environment.NewLine }, StringSplitOptions.None);
foreach (var line in mJsLines)
{
jsNewLine();
js.Append(line);
}
}
// Construct static fields
foreach (var field in staticFields.Select(x => x.Key))
{
jsNewLine();
js.AppendFormat("// {0}", field.FullName);
jsNewLine();
if (field.Name == "Empty" && field.DeclaringType.FullName == "System.String")
{
// Special case, as string does not have a static constructor to set String.Empty
js.AppendFormat("var {0} = \"\";", fieldNames[field]);
}
else
{
js.AppendFormat("var {0} = {1};", fieldNames[field], DefaultValuer.Get(field.FieldType, fieldNames));
}
}
// Construct type data
var typesSeenOrdered = typesSeen
.Where(x => x.Value > 0)
.Select(x => x.Key)
.OrderByReferencedFirst(x => x)
.ToArray();
var domTypes = new Dictionary <string, TypeReference>();
foreach (var type in typesSeenOrdered)
{
var unmappedType = type;
var tDef = unmappedType.Resolve();
// Check for DOM types
var jsClassAttr = tDef.GetCustomAttribute <JsClassAttribute>();
if (jsClassAttr != null)
{
if (jsClassAttr.ConstructorArguments.Count == 1)
{
// Non-abstract types only
var tagOrConstructorName = (string)jsClassAttr.ConstructorArguments[0].Value;
domTypes.Add(tagOrConstructorName, unmappedType);
}
}
// Type JS
jsNewLine();
js.AppendFormat("// {0}", unmappedType.FullName);
jsNewLine();
js.AppendFormat("var {0}={{", typeNames[type]);
// Type information
js.AppendFormat("{0}:\"{1}\"", typeDataNames[TypeData.JsName], typeNames[type]);
js.AppendFormat(", {0}:\"{1}\"", typeDataNames[TypeData.Name], unmappedType.Name());
js.AppendFormat(", {0}:\"{1}\"", typeDataNames[TypeData.Namespace], unmappedType.Namespace);
js.AppendFormat(", {0}:{1}", typeDataNames[TypeData.IsValueType], unmappedType.IsValueType ? "true" : "false");
js.AppendFormat(", {0}:{1}", typeDataNames[TypeData.IsPrimitive], unmappedType.IsPrimitive ? "true" : "false");
js.AppendFormat(", {0}:{1}", typeDataNames[TypeData.IsArray], unmappedType.IsArray ? "true" : "false");
js.AppendFormat(", {0}:{1}", typeDataNames[TypeData.ElementType], unmappedType.IsArray ? typeNames.ValueOrDefault(((ArrayType)unmappedType).ElementType, "null") : "null");
js.AppendFormat(", {0}:{1}", typeDataNames[TypeData.IsInterface], tDef.IsInterface ? "true" : "false");
var assignableTo = typesSeenOrdered.Where(x => unmappedType.IsAssignableTo(x)).Where(x => !x.IsSame(unmappedType)).ToArray();
js.AppendFormat(", {0}:[{1}]", typeDataNames[TypeData.AssignableTo], string.Join(", ", assignableTo.Select(x => typeNames[x])));
if (tDef.FullName == "System.Collections.Generic.Dictionary`2")
{
var typeGen = (GenericInstanceType)type;
var dict = tDef.Module.Import(typeof(DotNetWebToolkit.Cil2Js.JsResolvers.Classes._Dictionary <,>));
var dictGen = dict.MakeGeneric(typeGen.GenericArguments[0], typeGen.GenericArguments[1]);
var jsSlotsName = fieldNames[dictGen.EnumResolvedFields().First(x => x.Name == "slots")];
var slot = dictGen.Resolve().NestedTypes.First(x => x.Name == "Slot");
var slotGen = slot.MakeGeneric(typeGen.GenericArguments[0], typeGen.GenericArguments[1]);
var jsHashCodeName = fieldNames[slotGen.EnumResolvedFields().First(x => x.Name == "hashCode")];
var jskeyName = fieldNames[slotGen.EnumResolvedFields().First(x => x.Name == "key")];
var jsValueName = fieldNames[slotGen.EnumResolvedFields().First(x => x.Name == "value")];
js.AppendFormat(", {0}:['{1}','{2}','{3}','{4}']", typeDataNames[TypeData.IsDictionary], jsSlotsName, jsHashCodeName, jskeyName, jsValueName);
}
if (!tDef.IsInterface)
{
if (!tDef.IsAbstract)
{
// Virtual method table, only needed on concrete types
var typeAndBases = type.EnumThisAllBaseTypes().ToArray();
var methods = allVirtualMethods.ValueOrDefault(type);
if (methods != null)
{
var idxs = methods
.Select(x => {
var xBasemost = x.GetBasemostMethod(x);
return(new { m = x, idx = virtualCallIndices[xBasemost] });
})
.OrderBy(x => x.idx)
.ToArray();
var s = string.Join(", ", idxs.Select(x => methodNames.ValueOrDefault(x.m, "null")));
js.AppendFormat(", {0}:[{1}]", typeDataNames[TypeData.VTable], s);
}
// Interface tables, only needed on concrete types
var implementedIFaces = interfaceCalls.Where(x => typeAndBases.Any(y => y.DoesImplement(x.Key))).ToArray();
foreach (var iFace in implementedIFaces)
{
js.Append(", ");
var iFaceName = interfaceNames[iFace.Key];
js.AppendFormat("{0}:[", iFaceName);
var qInterfaceTableNames =
from iMethod in iFace.Value
let tMethod = typeAndBases.SelectMany(x => x.EnumResolvedMethods(iMethod)).First(x => x.IsImplementationOf(iMethod))
//let tM2 = JsResolver.ResolveMethod(tMethod)
let idx = interfaceCallIndices[iMethod]
orderby idx
let methodName = methodNames[tMethod]
select methodName;
var interfaceTableNames = qInterfaceTableNames.ToArray();
js.Append(string.Join(", ", interfaceTableNames));
js.Append("]");
}
}
}
if (tDef.IsEnum && tDef.GetCustomAttribute <JsStringEnumAttribute>() != null)
{
// JS string/enum map
var values = tDef.Fields.Where(x => x.IsLiteral).Select(x => {
return(string.Format("{0}:\"{1}\",\"{1}\":{0}", x.Constant, JsResolver.JsName(x)));
}).ToArray();
js.AppendFormat(", {0}:{{{1}}}", typeDataNames[TypeData.EnumStringMap], string.Join(", ", values));
}
// end
js.Append("};");
}
// Add type of each type, if System.RuntimeType has been seen
var typeRuntimeType = typesSeen.Keys.FirstOrDefault(x => x.FullName == "System.RuntimeType");
if (typeRuntimeType != null)
{
jsNewLine();
foreach (var type in typesSeenOrdered)
{
js.Append(typeNames[type]);
js.Append("._ = ");
}
js.Append(typeNames[typeRuntimeType]);
js.Append(";");
}
// Add comments descibing each interface
jsNewLine();
js.Append("// Interface name map");
jsNewLine();
js.AppendFormat("// {0} = VTable", typeDataNames[TypeData.VTable]);
foreach (var iFace in interfaceNames)
{
jsNewLine();
js.AppendFormat("// {0} = {1}", iFace.Value, iFace.Key.FullName);
}
// Add map of DOM types
if (domTypes.Any())
{
jsNewLine();
js.Append("// DOM type mapping");
jsNewLine();
// TODO: Auto-name this
js.Append("var __ = {");
jsIndent++;
foreach (var domType in domTypes)
{
jsNewLine();
js.AppendFormat("'{0}': {1},", domType.Key, typeNames[domType.Value]);
}
js.Length--;
jsIndent--;
jsNewLine();
js.Append("};");
}
if (typesSeenOrdered.Any())
{
jsNewLine();
js.Append("// json type mapping");
jsNewLine();
// TODO: Auto-name this
js.Append("var $$ = {");
foreach (var type in typesSeenOrdered)
{
js.AppendFormat("'{0}':{0},", typeNames[type]);
}
js.Length--;
js.Append("};");
var typesDicts = typesSeenOrdered
.Where(x => x.IsGenericInstance && x.Resolve().FullName == "System.Collections.Generic.Dictionary`2")
.ToArray();
if (typesDicts.Any())
{
jsNewLine();
js.Append("// json dictionary info");
jsNewLine();
// TODO: Auto-name or get rid of this
js.Append("var $d = {");
var any = false;
foreach (var type in typesDicts)
{
var typeName = typeNames[type];
var ctor = type.EnumResolvedMethods().First(x => x.Name == ".ctor" && !x.HasParameters);
var mAdd = type.EnumResolvedMethods().First(x => x.Name == "Add");
// If dict not involved in JSON, these methods may not be present
if (methodNames.ContainsKey(ctor) && methodNames.ContainsKey(mAdd))
{
var ctorName = methodNames[ctor];
var mAddName = methodNames[mAdd];
js.AppendFormat("'{0}':[{1},{2}],", typeName, ctorName, mAddName);
any = true;
}
}
if (any)
{
js.Length--;
}
js.Append("};");
}
}
jsNewLine();
jsNewLine();
js.Append("// Exports");
if (!testing)
{
var rootMethodsByType = rootMethods.ToLookup(x => x.DeclaringType, TypeExtensions.TypeRefEqComparerInstance);
Action <NamespaceTree> treeToJs = null;
treeToJs = tree => {
js.Append("{");
jsIndent++;
foreach (var subNs in tree.Namespaces)
{
jsNewLine();
js.AppendFormat("'{0}': ", subNs.NamespacePart);
treeToJs(subNs);
}
if (tree.Types.Any())
{
foreach (var type in tree.Types)
{
jsNewLine();
js.AppendFormat("'{0}': {{", type.Name);
jsIndent++;
foreach (var method in rootMethodsByType[type])
{
jsNewLine();
js.AppendFormat("'{0}': {1},", method.Name, methodNames[method]);
}
js.Length--;
jsIndent--;
jsNewLine();
js.Append("},");
}
js.Length--;
}
jsIndent--;
jsNewLine();
js.Append("}");
};
var trees = NamespaceTree.Make(rootMethodsByType.Select(x => x.Key));
foreach (var tree in trees)
{
jsNewLine();
js.AppendFormat("window['{0}'] = ", tree.NamespacePart);
treeToJs(tree);
js.Append(";");
}
}
else
{
jsNewLine();
js.AppendFormat("window['main'] = {0};", methodNames[rootMethods.First()]);
}
jsIndent--;
jsNewLine();
jsNewLine();
js.Append("})();");
var jsStr = js.ToString();
//Console.WriteLine(jsStr);
var qFieldMap =
from fieldName in fieldNames
let declType = fieldName.Key.DeclaringType
let declTypeMapped = JsResolver.TypeMapReverse(declType) ?? declType
let declTypeName = declTypeMapped.AssemblyQualifiedName()
where declType != null
group fieldName by declTypeName;
var fieldMap = qFieldMap.ToDictionary(x => x.Key, x => x.ToDictionary(y => y.Key.Name, y => y.Value));
var qTypeMap =
from typeName in typeNames
let type = typeName.Key.AssemblyQualifiedName()
where type != null
select new { type, typeName.Value };
var ttt = qTypeMap.ToArray();
var typeMap = ttt.ToDictionary(x => x.type, x => x.Value);
var jsTypeMap = new JsonTypeMap(typeMap, fieldMap);
return(new JsResult(jsStr, jsTypeMap));
}
public static ICode V(ICode ast)
{
var ctx = ast.Ctx;
var blockInfo = FindSuitableBlocks.GetInfo(ast);
var bestBlock = blockInfo
.Where(x => !x.Value.containsLeaveProtectedRegion && x.Value.numConts <= 1)
.OrderBy(x => x.Value.numConts == 0 ? 1000 : x.Value.numConts)
.ThenBy(x => x.Value.numICodes)
.FirstOrDefault();
if (bestBlock.Key == null)
{
return(ast);
}
if (bestBlock.Value.numConts > 1)
{
// Best block must have just one continuation
return(ast);
}
Stmt addContTo = null;
if (bestBlock.Value.numConts == 0)
{
addContTo = (Stmt)blockInfo.FirstOrDefault(x => x.Value.numConts == 0 && x.Key != bestBlock.Key).Key;
if (addContTo == null)
{
return(ast);
}
}
var blockAst = (Stmt)bestBlock.Key;
if (blockAst.StmtType != Stmt.NodeType.Block)
{
// Best block must be StmtBlock
return(ast);
}
var stmtBlock = (StmtBlock)blockAst;
var stmts = stmtBlock.Statements.ToArray();
var cont = bestBlock.Value.numConts == 0 ? new StmtContinuation(ctx, addContTo, false) : (StmtContinuation)stmts.Last();
var ifSkipContentPhi = new ExprVarPhi(ctx);
var ifSkipInitialVar = ctx.Local(ctx.Boolean);
var ifSkipContentVar = ctx.Local(ctx.Boolean);
var ifSkipContentPhiExprs = new List <Expr> {
ifSkipInitialVar, ifSkipContentVar
};
var ifSkipReset = new StmtAssignment(ctx, ifSkipContentVar, ctx.Literal(false));
var inIfBlock = new StmtBlock(ctx, stmts.Take(stmts.Length - (bestBlock.Value.numConts == 0 ? 0 : 1)));
var ifBlock = new StmtIf(ctx, ctx.ExprGen.Not(ifSkipContentPhi), inIfBlock, null);
var newBlock = new StmtBlock(ctx, ifBlock, ifSkipReset, cont);
ast = VisitorReplace.V(ast, blockAst, newBlock);
var allConts = VisitorFindContinuationsRecursive.Get(ast);
var contsNeedChanging = allConts.Where(x => x != cont && x.To == cont.To).ToArray();
var contsReplaceInfo = contsNeedChanging
.Select(x => {
var ifVar = ctx.Local(ctx.Boolean);
var newCont = new StmtBlock(ctx,
new StmtAssignment(ctx, ifVar, ctx.Literal(true)),
new StmtContinuation(ctx, newBlock, x.LeaveProtectedRegion));
return(new { oldCont = x, ifVar, newCont });
})
.ToArray();
foreach (var contReplace in contsReplaceInfo)
{
ifSkipContentPhiExprs.Add(contReplace.ifVar);
ast = VisitorReplace.V(ast, contReplace.oldCont, contReplace.newCont);
}
ifSkipContentPhi.Exprs = ifSkipContentPhiExprs;
// TODO: Shouldn't be required, but definite-assignment doesn't quite work properly, so is required
var initalSkipVarAssignment = new StmtAssignment(ctx, ifSkipInitialVar, ctx.Literal(false));
var newAst = new StmtBlock(ctx, initalSkipVarAssignment, (Stmt)ast);
return(newAst);
}
protected override ICode VisitBlock(StmtBlock s)
{
var ctx = s.Ctx;
var statements = s.Statements
.Select(x => (Stmt)this.Visit(x))
.Where(x => x != null)
.ToArray();
var stNew = statements.Combine((a, b) => {
// If two 'if' statements are both continuations, then bring a recursive continuation forwards if possible
if (a.StmtType == Stmt.NodeType.If && b.StmtType == Stmt.NodeType.If)
{
var aIf = (StmtIf)a;
var bIf = (StmtIf)b;
if (aIf.Then != null && bIf.Then != null &&
aIf.Then.StmtType == Stmt.NodeType.Continuation && bIf.Then.StmtType == Stmt.NodeType.Continuation &&
aIf.Else == null && bIf.Else == null)
{
var aCont = (StmtContinuation)aIf.Then;
var bCont = (StmtContinuation)bIf.Then;
if (aCont.To != this.block && bCont.To == this.block)
{
return(new StmtBlock(ctx, b, a));
}
}
}
return(null);
})
.ToArray();
if (!statements.SequenceEqual(stNew))
{
return(new StmtBlock(ctx, stNew));
}
// If an 'if' statement containing only a continuation is followed by any other kind of statement then swap them
// (with suitable 'if' guard). Look ahead and encase as much as possible in the 'if' guard
for (int i = 0; i < statements.Length - 1; i++)
{
var stmt = statements[i];
if (stmt.StmtType == Stmt.NodeType.If)
{
var sIf = (StmtIf)stmt;
if (sIf.Then != null && sIf.Then.StmtType == Stmt.NodeType.Continuation && sIf.Else == null)
{
var moveCount = 0;
for (int j = i + 1; j < statements.Length; j++)
{
var b = statements[j];
bool move;
if (b.StmtType == Stmt.NodeType.Continuation)
{
move = false;
}
else if (b.StmtType != Stmt.NodeType.If)
{
move = true;
}
else
{
var bIf = (StmtIf)b;
move = bIf.Then == null || bIf.Then.StmtType != Stmt.NodeType.Continuation || bIf.Else != null;
}
if (move)
{
moveCount++;
}
else
{
break;
}
}
if (moveCount > 0)
{
var moveBlock = new StmtBlock(ctx, statements.Skip(i + 1).Take(moveCount));
var ifBlock = new StmtIf(ctx, ctx.ExprGen.Not(sIf.Condition), moveBlock, null);
var allStmts =
statements.Take(i)
.Concat(ifBlock)
.Concat(statements[i])
.Concat(statements.Skip(i + 1 + moveCount))
.ToArray();
return(new StmtBlock(ctx, allStmts));
}
}
}
}
// Reorder if/continuations at end of block to group by continuation target
var finalContsRev = statements.Reverse().TakeWhile(x => {
if (x.StmtType == Stmt.NodeType.Continuation)
{
return(true);
}
if (x.StmtType == Stmt.NodeType.If)
{
var xIf = (StmtIf)x;
if (xIf.Else == null && xIf.Then.StmtType == Stmt.NodeType.Continuation)
{
return(true);
}
}
return(false);
})
.Select(x => {
Stmt to;
if (x.StmtType == Stmt.NodeType.Continuation)
{
to = ((StmtContinuation)x).To;
}
else
{
to = ((StmtContinuation)((StmtIf)x).Then).To;
}
return(new { stmt = x, to });
}).ToArray();
var lookForMidCont = finalContsRev.Reverse().TakeWhile(x => x.stmt.StmtType != Stmt.NodeType.Continuation).ToArray();
if (lookForMidCont.Length < finalContsRev.Length - 1)
{
// Look for non-if continuation in middle of final continuations
// I suspect that this cannot ever occur
var stmts = statements.Take(statements.Length - finalContsRev.Length)
.Concat(lookForMidCont.Select(x => x.stmt))
.Concat(finalContsRev.Select(x => x.stmt).Reverse().ElementAt(lookForMidCont.Length)).ToArray();
return(new StmtBlock(s.Ctx, stmts));
}
if (finalContsRev.Count() >= 2)
{
var newFinal = finalContsRev.Combine((a, b) => {
if (a.stmt.StmtType == Stmt.NodeType.Continuation && a.to == b.to)
{
return(a);
}
return(null);
});
if (!finalContsRev.SequenceEqual(newFinal))
{
var stmts = statements.Take(statements.Length - finalContsRev.Length).Concat(newFinal.Reverse().Select(x => x.stmt));
return(new StmtBlock(s.Ctx, stmts));
}
var dups = finalContsRev.GroupBy(x => x.to).Select(x => new { to = x.Key, count = x.Count() }).Where(x => x.count >= 2).ToArray();
if (dups.Any())
{
var finalStmts = finalContsRev.Reverse().ToArray();
foreach (var dup in dups)
{
var movingBack = new List <Stmt>();
var addIfs = new Dictionary <Stmt, IEnumerable <Expr> >();
foreach (var stmt in finalStmts)
{
if (stmt.to == dup.to)
{
movingBack.Add(stmt.stmt);
}
else
{
addIfs.Add(stmt.stmt, movingBack.Select(x => s.Ctx.ExprGen.Not(((StmtIf)x).Condition)).ToArray());
}
if (movingBack.Count == dup.count)
{
finalStmts = finalStmts.SelectMany(x => {
if (movingBack.Contains(x.stmt))
{
if (x.stmt == movingBack.Last())
{
return(movingBack.Select(y => new { stmt = (Stmt)y, to = x.to }));
}
else
{
return(finalStmts.EmptyOf());
}
}
else
{
var addIf = addIfs.ValueOrDefault(x.stmt);
if (addIf != null && addIf.Any())
{
var @if = addIf.Aggregate((a, b) => s.Ctx.ExprGen.And(a, b));
var newIf = new StmtIf(s.Ctx, @if, x.stmt, null);
return(new[] { new { stmt = (Stmt)newIf, to = x.to } });
}
else
{
return(new[] { x });
}
}
}).ToArray();
break;
}
}
}
var stmts = statements.Take(statements.Length - finalContsRev.Length).Concat(finalStmts.Select(x => x.stmt));
return(new StmtBlock(s.Ctx, stmts));
}
}
if (!statements.SequenceEqual(s.Statements))
{
return(new StmtBlock(ctx, statements));
}
else
{
return(s);
}
}
protected override ICode VisitBlock(StmtBlock s)
{
return(new StmtBlock(s.Ctx, s.Statements.Select(x => (Stmt)this.Visit(x))));
}
protected virtual ICode VisitBlock(StmtBlock s)
{
this.ThrowOnNoOverride();
return(this.HandleBlock(s, stmt => (Stmt)this.Visit(stmt)));
}
protected override ICode VisitContinuation(StmtContinuation s)
{
// TODO: Why is this de-recursing blocks in continuations? Why doesn't it just derecurse itself (if possible)???
if (s.To.StmtType != Stmt.NodeType.Block)
{
return(base.VisitContinuation(s));
}
if (!this.seen.Add(s.To))
{
return(base.VisitContinuation(s));
}
var block = (StmtBlock)s.To;
foreach (var stmt in block.Statements)
{
if (stmt.StmtType == Stmt.NodeType.Continuation)
{
// Continuation not inside 'if'
var sCont = (StmtContinuation)stmt;
if (sCont.To == block)
{
// Recursive, so derecurse with no condition on loop
var body = new StmtBlock(s.Ctx, block.Statements.TakeWhile(x => x != stmt).ToArray());
var replaceWith = new StmtDoLoop(s.Ctx, body, new ExprLiteral(s.Ctx, true, s.Ctx.Boolean));
this.replaces.Add(s.To, replaceWith);
return(base.VisitContinuation(s));
}
}
if (stmt.StmtType == Stmt.NodeType.If)
{
// Continuation only statement within 'if' with only a 'then' clause
var sIf = (StmtIf)stmt;
if (sIf.Else == null && sIf.Then.StmtType == Stmt.NodeType.Continuation)
{
var sThen = (StmtContinuation)sIf.Then;
if (sThen.To == block)
{
// Recursive, so derecurse
var condition = sIf.Condition;
var bodyStmts = block.Statements.TakeWhile(x => x != stmt).ToArray();
var bodyLast = bodyStmts.LastOrDefault();
var body = new StmtBlock(s.Ctx, bodyStmts);
var loop = new StmtDoLoop(s.Ctx, body, condition);
var afterLoop = block.Statements.SkipWhile(x => x != stmt).Skip(1).ToArray();
if (VisitorFindContinuations.Get(new StmtBlock(s.Ctx, afterLoop)).Any(x => x.To == block))
{
// Cannot de-recurse yet, must wait for continuations to be merged
return(base.VisitContinuation(s));
}
Stmt replaceWith;
if (afterLoop.Any())
{
var loopAndAfter = new[] { loop }.Concat(afterLoop).ToArray();
replaceWith = new StmtBlock(s.Ctx, loopAndAfter);
}
else
{
replaceWith = loop;
}
this.replaces.Add(s.To, replaceWith);
return(base.VisitContinuation(s));
}
}
}
if (VisitorFindContinuations.Any(stmt))
{
// Another continuation present, cannot derecurse
break;
}
}
return(base.VisitContinuation(s));
}
