-package org.simantics.scl.compiler.elaboration.expressions;\r
-\r
-import gnu.trove.map.hash.TObjectIntHashMap;\r
-import gnu.trove.set.hash.THashSet;\r
-import gnu.trove.set.hash.TIntHashSet;\r
-\r
-import java.util.ArrayList;\r
-\r
-import org.simantics.scl.compiler.common.exceptions.InternalCompilerError;\r
-import org.simantics.scl.compiler.elaboration.contexts.ReplaceContext;\r
-import org.simantics.scl.compiler.elaboration.contexts.SimplificationContext;\r
-import org.simantics.scl.compiler.elaboration.contexts.TranslationContext;\r
-import org.simantics.scl.compiler.elaboration.contexts.TypingContext;\r
-import org.simantics.scl.compiler.environment.Environment;\r
-import org.simantics.scl.compiler.errors.Locations;\r
-import org.simantics.scl.compiler.internal.codegen.references.BoundVar;\r
-import org.simantics.scl.compiler.internal.codegen.references.IVal;\r
-import org.simantics.scl.compiler.internal.codegen.writer.CodeWriter;\r
-import org.simantics.scl.compiler.internal.codegen.writer.RecursiveDefinitionWriter;\r
-import org.simantics.scl.compiler.internal.elaboration.decomposed.DecomposedExpression;\r
-import org.simantics.scl.compiler.internal.elaboration.utils.ExpressionDecorator;\r
-import org.simantics.scl.compiler.internal.elaboration.utils.StronglyConnectedComponents;\r
-import org.simantics.scl.compiler.types.Type;\r
-import org.simantics.scl.compiler.types.Types;\r
-import org.simantics.scl.compiler.types.exceptions.MatchException;\r
-import org.simantics.scl.compiler.types.kinds.Kinds;\r
-\r
-public class ELet extends Expression {\r
- public Assignment[] assignments;\r
- public Expression in;\r
- \r
- public ELet(long loc, Assignment[] assignments, Expression in) {\r
- super(loc);\r
- this.assignments = assignments;\r
- this.in = in;\r
- }\r
-\r
- @Override\r
- public void collectRefs(final TObjectIntHashMap<Object> allRefs, final TIntHashSet refs) {\r
- for(Assignment assign : assignments)\r
- assign.value.collectRefs(allRefs, refs);\r
- in.collectRefs(allRefs, refs);\r
- }\r
- \r
- @Override\r
- public void collectVars(TObjectIntHashMap<Variable> allVars,\r
- TIntHashSet vars) {\r
- for(Assignment assign : assignments)\r
- assign.value.collectVars(allVars, vars);\r
- in.collectVars(allVars, vars);\r
- }\r
- \r
- @Override\r
- protected void updateType() throws MatchException {\r
- setType(in.getType());\r
- }\r
- \r
- /**\r
- * Splits let \r
- */\r
- @Override\r
- public Expression simplify(SimplificationContext context) {\r
- \r
- // Simplify assignments\r
- for(Assignment assignment : assignments) {\r
- assignment.value = assignment.value.simplify(context);\r
- }\r
- \r
- // Find strongly connected components\r
- final TObjectIntHashMap<Variable> allVars = new TObjectIntHashMap<Variable>(\r
- 2*assignments.length, 0.5f, -1);\r
-\r
- for(int i=0;i<assignments.length;++i)\r
- for(Variable var : assignments[i].pattern.getFreeVariables())\r
- allVars.put(var, i);\r
- final boolean isRecursive[] = new boolean[assignments.length];\r
- final ArrayList<int[]> components = new ArrayList<int[]>(Math.max(10, assignments.length)); \r
- new StronglyConnectedComponents(assignments.length) {\r
- @Override\r
- protected int[] findDependencies(int u) {\r
- TIntHashSet vars = new TIntHashSet();\r
- assignments[u].value.collectVars(allVars, vars);\r
- if(vars.contains(u))\r
- isRecursive[u] = true;\r
- return vars.toArray();\r
- }\r
-\r
- @Override\r
- protected void reportComponent(int[] component) {\r
- components.add(component);\r
- }\r
-\r
- }.findComponents();\r
-\r
- // Simplify in\r
- Expression result = in.simplify(context);\r
- \r
- // Handle each component\r
- for(int j=components.size()-1;j>=0;--j) {\r
- int[] component = components.get(j);\r
- boolean recursive = component.length > 1 || isRecursive[component[0]];\r
- if(recursive) {\r
- Assignment[] cAssignments = new Assignment[component.length];\r
- for(int i=0;i<component.length;++i)\r
- cAssignments[i] = assignments[component[i]];\r
- result = new ELet(location, cAssignments, result);\r
- }\r
- else {\r
- Assignment assignment = assignments[component[0]];\r
- Expression pattern = assignment.pattern;\r
- \r
- if(pattern instanceof EVariable) {\r
- EVariable pvar = (EVariable)pattern;\r
- result = new ESimpleLet(location, pvar.variable, assignment.value, result);\r
- }\r
- else {\r
- result = new EMatch(location, new Expression[] {assignment.value},\r
- new Case(new Expression[] {pattern}, result));\r
- }\r
- }\r
- }\r
- \r
- return result;\r
- }\r
-\r
- @Override\r
- public void collectFreeVariables(THashSet<Variable> vars) {\r
- in.collectFreeVariables(vars);\r
- for(Assignment assign : assignments)\r
- assign.value.collectFreeVariables(vars);\r
- for(Assignment assign : assignments) \r
- assign.pattern.removeFreeVariables(vars);\r
- }\r
-\r
- @Override\r
- public Expression resolve(TranslationContext context) {\r
- throw new InternalCompilerError("ELet should be already resolved.");\r
- }\r
- \r
- @Override\r
- public Expression replace(ReplaceContext context) {\r
- Assignment[] newAssignments = new Assignment[assignments.length];\r
- for(int i=0;i<assignments.length;++i)\r
- newAssignments[i] = assignments[i].replace(context); \r
- Expression newIn = in.replace(context);\r
- return new ELet(getLocation(), newAssignments, newIn);\r
- }\r
- \r
- @Override\r
- public IVal toVal(Environment env, CodeWriter w) {\r
- // Create bound variables\r
- BoundVar[] vars = new BoundVar[assignments.length];\r
- for(int i=0;i<assignments.length;++i) {\r
- Expression pattern = assignments[i].pattern;\r
- if(!(pattern instanceof EVariable))\r
- throw new InternalCompilerError("Cannot handle pattern targets in recursive assignments.");\r
- vars[i] = new BoundVar(pattern.getType());\r
- ((EVariable)pattern).getVariable().setVal(vars[i]);\r
- }\r
- \r
- // Create values\r
- RecursiveDefinitionWriter rdw = w.createRecursiveDefinition();\r
- long range = Locations.NO_LOCATION;\r
- for(Assignment assign2 : assignments) {\r
- range = Locations.combine(range, assign2.pattern.location);\r
- range = Locations.combine(range, assign2.value.location);\r
- }\r
- rdw.setLocation(range);\r
- for(int i=0;i<assignments.length;++i) {\r
- DecomposedExpression decomposed = \r
- DecomposedExpression.decompose(assignments[i].value);\r
- CodeWriter newW = rdw.createFunction(vars[i], \r
- decomposed.typeParameters,\r
- decomposed.effect,\r
- decomposed.returnType, \r
- decomposed.parameterTypes);\r
- IVal[] parameters = newW.getParameters();\r
- for(int j=0;j<parameters.length;++j)\r
- decomposed.parameters[j].setVal(parameters[j]);\r
- newW.return_(decomposed.body.toVal(env, newW));\r
- }\r
- return in.toVal(env, w);\r
- }\r
- \r
- private void checkAssignments(TypingContext context) {\r
- for(Assignment assign : assignments)\r
- assign.pattern = assign.pattern.checkTypeAsPattern(context, Types.metaVar(Kinds.STAR));\r
- for(Assignment assign : assignments)\r
- assign.value = assign.value.checkType(context, assign.pattern.getType());\r
- }\r
- \r
- @Override\r
- public Expression inferType(TypingContext context) {\r
- checkAssignments(context);\r
- in = in.inferType(context);\r
- return this;\r
- }\r
- \r
- @Override\r
- public Expression checkBasicType(TypingContext context, Type requiredType) {\r
- checkAssignments(context);\r
- in = in.checkType(context, requiredType);\r
- return this;\r
- }\r
-\r
- @Override\r
- public Expression decorate(ExpressionDecorator decorator) {\r
- in = in.decorate(decorator);\r
- for(Assignment assignment : assignments)\r
- assignment.decorate(decorator);\r
- return decorator.decorate(this);\r
- }\r
-\r
- @Override\r
- public void collectEffects(THashSet<Type> effects) {\r
- for(Assignment assignment : assignments) {\r
- assignment.pattern.collectEffects(effects);\r
- assignment.value.collectEffects(effects);\r
- }\r
- in.collectEffects(effects);\r
- }\r
- \r
- @Override\r
- public void setLocationDeep(long loc) {\r
- if(location == Locations.NO_LOCATION) {\r
- location = loc;\r
- for(Assignment assignment : assignments)\r
- assignment.setLocationDeep(loc);\r
- in.setLocationDeep(loc);\r
- }\r
- }\r
- \r
- @Override\r
- public void accept(ExpressionVisitor visitor) {\r
- visitor.visit(this);\r
- }\r
-\r
- @Override\r
- public void forVariables(VariableProcedure procedure) {\r
- for(Assignment assignment : assignments)\r
- assignment.forVariables(procedure);\r
- in.forVariables(procedure);\r
- }\r
- \r
- @Override\r
- public Expression accept(ExpressionTransformer transformer) {\r
- return transformer.transform(this);\r
- }\r
-\r
-}\r
+package org.simantics.scl.compiler.elaboration.expressions;
+
+import java.util.ArrayList;
+
+import org.simantics.scl.compiler.common.exceptions.InternalCompilerError;
+import org.simantics.scl.compiler.compilation.CompilationContext;
+import org.simantics.scl.compiler.elaboration.contexts.ReplaceContext;
+import org.simantics.scl.compiler.elaboration.contexts.SimplificationContext;
+import org.simantics.scl.compiler.elaboration.contexts.TranslationContext;
+import org.simantics.scl.compiler.elaboration.contexts.TypingContext;
+import org.simantics.scl.compiler.errors.Locations;
+import org.simantics.scl.compiler.internal.codegen.references.BoundVar;
+import org.simantics.scl.compiler.internal.codegen.references.IVal;
+import org.simantics.scl.compiler.internal.codegen.writer.CodeWriter;
+import org.simantics.scl.compiler.internal.codegen.writer.RecursiveDefinitionWriter;
+import org.simantics.scl.compiler.internal.elaboration.decomposed.DecomposedExpression;
+import org.simantics.scl.compiler.internal.elaboration.utils.StronglyConnectedComponents;
+import org.simantics.scl.compiler.types.Type;
+import org.simantics.scl.compiler.types.Types;
+import org.simantics.scl.compiler.types.exceptions.MatchException;
+import org.simantics.scl.compiler.types.kinds.Kinds;
+
+import gnu.trove.map.hash.TObjectIntHashMap;
+import gnu.trove.set.hash.THashSet;
+import gnu.trove.set.hash.TIntHashSet;
+
+/**
+ * Generated maily from EPreLet
+ */
+public class ELet extends Expression {
+ public Assignment[] assignments;
+ public Expression in;
+
+ public ELet(long loc, Assignment[] assignments, Expression in) {
+ super(loc);
+ this.assignments = assignments;
+ this.in = in;
+ }
+
+ @Override
+ public void collectVars(TObjectIntHashMap<Variable> allVars,
+ TIntHashSet vars) {
+ for(Assignment assign : assignments)
+ assign.value.collectVars(allVars, vars);
+ in.collectVars(allVars, vars);
+ }
+
+ @Override
+ protected void updateType() throws MatchException {
+ setType(in.getType());
+ }
+
+ /**
+ * Splits let
+ */
+ @Override
+ public Expression simplify(SimplificationContext context) {
+
+ // Simplify assignments
+ for(Assignment assignment : assignments) {
+ assignment.value = assignment.value.simplify(context);
+ }
+
+ // Find strongly connected components
+ final TObjectIntHashMap<Variable> allVars = new TObjectIntHashMap<Variable>(
+ 2*assignments.length, 0.5f, -1);
+
+ for(int i=0;i<assignments.length;++i)
+ for(Variable var : assignments[i].pattern.getFreeVariables())
+ allVars.put(var, i);
+ final boolean isRecursive[] = new boolean[assignments.length];
+ final ArrayList<int[]> components = new ArrayList<int[]>(Math.max(10, assignments.length));
+ new StronglyConnectedComponents(assignments.length) {
+ @Override
+ protected int[] findDependencies(int u) {
+ TIntHashSet vars = new TIntHashSet();
+ assignments[u].value.collectVars(allVars, vars);
+ if(vars.contains(u))
+ isRecursive[u] = true;
+ return vars.toArray();
+ }
+
+ @Override
+ protected void reportComponent(int[] component) {
+ components.add(component);
+ }
+
+ }.findComponents();
+
+ // Simplify in
+ Expression result = in.simplify(context);
+
+ // Handle each component
+ for(int j=components.size()-1;j>=0;--j) {
+ int[] component = components.get(j);
+ boolean recursive = component.length > 1 || isRecursive[component[0]];
+ if(recursive) {
+ Assignment[] cAssignments = new Assignment[component.length];
+ for(int i=0;i<component.length;++i)
+ cAssignments[i] = assignments[component[i]];
+ result = new ELet(location, cAssignments, result);
+ }
+ else {
+ Assignment assignment = assignments[component[0]];
+ Expression pattern = assignment.pattern;
+
+ if(pattern instanceof EVariable) {
+ EVariable pvar = (EVariable)pattern;
+ result = new ESimpleLet(location, pvar.variable, assignment.value, result);
+ }
+ else {
+ result = new EMatch(location, new Expression[] {assignment.value},
+ new Case(new Expression[] {pattern}, result));
+ }
+ }
+ }
+
+ return result;
+ }
+
+ @Override
+ public void collectFreeVariables(THashSet<Variable> vars) {
+ in.collectFreeVariables(vars);
+ for(Assignment assign : assignments)
+ assign.value.collectFreeVariables(vars);
+ for(Assignment assign : assignments)
+ assign.pattern.removeFreeVariables(vars);
+ }
+
+ @Override
+ public Expression resolve(TranslationContext context) {
+ throw new InternalCompilerError("ELet should be already resolved.");
+ }
+
+ @Override
+ public Expression replace(ReplaceContext context) {
+ Assignment[] newAssignments = new Assignment[assignments.length];
+ for(int i=0;i<assignments.length;++i)
+ newAssignments[i] = assignments[i].replace(context);
+ Expression newIn = in.replace(context);
+ return new ELet(getLocation(), newAssignments, newIn);
+ }
+
+ @Override
+ public IVal toVal(CompilationContext context, CodeWriter w) {
+ // Create bound variables
+ BoundVar[] vars = new BoundVar[assignments.length];
+ for(int i=0;i<assignments.length;++i) {
+ Expression pattern = assignments[i].pattern;
+ if(!(pattern instanceof EVariable))
+ throw new InternalCompilerError("Cannot handle pattern targets in recursive assignments.");
+ vars[i] = new BoundVar(pattern.getType());
+ ((EVariable)pattern).getVariable().setVal(vars[i]);
+ }
+
+ // Create values
+ RecursiveDefinitionWriter rdw = w.createRecursiveDefinition();
+ long range = Locations.NO_LOCATION;
+ for(Assignment assign2 : assignments) {
+ range = Locations.combine(range, assign2.pattern.location);
+ range = Locations.combine(range, assign2.value.location);
+ }
+ rdw.setLocation(range);
+ for(int i=0;i<assignments.length;++i) {
+ DecomposedExpression decomposed =
+ DecomposedExpression.decompose(context.errorLog, assignments[i].value);
+ CodeWriter newW = rdw.createFunction(vars[i],
+ decomposed.typeParameters,
+ decomposed.effect,
+ decomposed.returnType,
+ decomposed.parameterTypes);
+ IVal[] parameters = newW.getParameters();
+ for(int j=0;j<parameters.length;++j)
+ decomposed.parameters[j].setVal(parameters[j]);
+ newW.return_(decomposed.body.toVal(context, newW));
+ }
+ return in.toVal(context, w);
+ }
+
+ private void checkAssignments(TypingContext context) {
+ for(Assignment assign : assignments)
+ assign.pattern = assign.pattern.checkTypeAsPattern(context, Types.metaVar(Kinds.STAR));
+ for(Assignment assign : assignments)
+ assign.value = assign.value.checkType(context, assign.pattern.getType());
+ }
+
+ @Override
+ public Expression inferType(TypingContext context) {
+ checkAssignments(context);
+ in = in.inferType(context);
+ return this;
+ }
+
+ @Override
+ public Expression checkBasicType(TypingContext context, Type requiredType) {
+ checkAssignments(context);
+ in = in.checkType(context, requiredType);
+ return this;
+ }
+
+ @Override
+ public Expression checkIgnoredType(TypingContext context) {
+ checkAssignments(context);
+ in = in.checkIgnoredType(context);
+ return this;
+ }
+
+ @Override
+ public void collectEffects(THashSet<Type> effects) {
+ for(Assignment assignment : assignments) {
+ assignment.pattern.collectEffects(effects);
+ assignment.value.collectEffects(effects);
+ }
+ in.collectEffects(effects);
+ }
+
+ @Override
+ public void setLocationDeep(long loc) {
+ if(location == Locations.NO_LOCATION) {
+ location = loc;
+ for(Assignment assignment : assignments)
+ assignment.setLocationDeep(loc);
+ in.setLocationDeep(loc);
+ }
+ }
+
+ @Override
+ public void accept(ExpressionVisitor visitor) {
+ visitor.visit(this);
+ }
+
+ @Override
+ public Expression accept(ExpressionTransformer transformer) {
+ return transformer.transform(this);
+ }
+
+ @Override
+ public int getSyntacticFunctionArity() {
+ return in.getSyntacticFunctionArity();
+ }
+
+}
Code Review / simantics / platform.git / blobdiff