1f4b44c2c0
* Move yield string constants to StringConstants class * Add GeneratedNamesManager class to store all generated names during unit compilation * Make GeneratedNamesManager class non static * Add Utils project to installer files * Add GeneratedNamesManager usage in CapturedVariablesSubstitutionsManager * Move GeneratedNamesManager initialization in CompilationUnit constructor * More GeneratedNamesManager usage * QuestionPointDesugarVisitor fix
521 lines
21 KiB
C#
521 lines
21 KiB
C#
// Copyright (c) Ivan Bondarev, Stanislav Mikhalkovich (for details please see \doc\copyright.txt)
|
||
// This code is distributed under the GNU LGPL (for details please see \doc\license.txt)
|
||
using PascalABCCompiler;
|
||
using PascalABCCompiler.CoreUtils;
|
||
using PascalABCCompiler.Errors;
|
||
using PascalABCCompiler.SyntaxTree;
|
||
using System;
|
||
using System.Collections.Generic;
|
||
using System.Linq;
|
||
using System.Text;
|
||
using System.Threading.Tasks;
|
||
|
||
namespace SyntaxVisitors
|
||
{
|
||
public class VarNames
|
||
{
|
||
public string VarName { get; set; }
|
||
public string VarEndName { get; set; }
|
||
|
||
public VarNames()
|
||
{
|
||
}
|
||
|
||
public VarNames(string varName, string varEndName)
|
||
{
|
||
VarName = varName;
|
||
VarEndName = varEndName;
|
||
}
|
||
}
|
||
|
||
public class LoweringVisitor : BaseChangeVisitor
|
||
{
|
||
private readonly GeneratedNamesManager generatedNamesManager;
|
||
|
||
private LoweringVisitor(GeneratedNamesManager generatedNamesManager)
|
||
{
|
||
this.generatedNamesManager = generatedNamesManager;
|
||
}
|
||
|
||
public static LoweringVisitor Create(GeneratedNamesManager generatedNamesManager) => new LoweringVisitor(generatedNamesManager);
|
||
|
||
private VarNames NewVarNames(ident name)
|
||
{
|
||
return new VarNames()
|
||
{
|
||
VarName = generatedNamesManager.GenerateName("$" + name.name),
|
||
VarEndName = generatedNamesManager.GenerateName("<>varLV")
|
||
};
|
||
}
|
||
|
||
private ident NewEnumeratorName()
|
||
{
|
||
return generatedNamesManager.GenerateName("$enumerator$");
|
||
}
|
||
|
||
private ident NewForeachCollectionName()
|
||
{
|
||
return generatedNamesManager.GenerateName("$coll$");
|
||
}
|
||
|
||
public static void Accept(procedure_definition pd, GeneratedNamesManager generatedNamesManager)
|
||
{
|
||
Create(generatedNamesManager).ProcessNode(pd);
|
||
}
|
||
|
||
public override void Enter(syntax_tree_node st)
|
||
{
|
||
base.Enter(st);
|
||
if (!(st is procedure_definition || st is block || st is statement_list
|
||
|| st.GetType() == typeof(case_node) || st.GetType() == typeof(for_node) || st.GetType() == typeof(foreach_stmt)
|
||
|| st.GetType() == typeof(if_node)
|
||
|| st.GetType() == typeof(repeat_node) || st.GetType() == typeof(while_node)
|
||
|| st.GetType() == typeof(with_statement) || st is try_stmt || st.GetType() == typeof(lock_stmt)))
|
||
{
|
||
//visitNode = false;
|
||
}
|
||
}
|
||
|
||
|
||
|
||
public override void visit(yield_unknown_foreach_type _unk)
|
||
{
|
||
// DO NOTHING
|
||
}
|
||
|
||
// frninja 21/05/16
|
||
public override void visit(foreach_stmt frch)
|
||
{
|
||
// Полный код Loweringа c yield_unknown_foreach_type = integer
|
||
// var a: System.Collections.Generic.IEnumerable<integer>;
|
||
// a := l;
|
||
// var en := a.GetEnumerator();
|
||
// while en.MoveNext do
|
||
// begin
|
||
// var curr := en.Current; // var не нужно ставить если curr была описана раньше
|
||
// Print(curr);
|
||
// end;
|
||
///
|
||
|
||
// var a: System.Collections.Generic.IEnumerable<yield_unknown_foreach_type> := l;
|
||
var foreachCollIdent = this.NewForeachCollectionName();
|
||
var foreachCollType = new template_type_reference(new named_type_reference("System.Collections.Generic.IEnumerable"),
|
||
new template_param_list(new yield_unknown_foreach_type(frch)));
|
||
var foreachCollVarDef = new var_statement(foreachCollIdent, foreachCollType);
|
||
|
||
var ass = new assign(foreachCollIdent, frch.in_what);
|
||
|
||
// var en := a.GetEnumerator();
|
||
var enumeratorIdent = this.NewEnumeratorName();
|
||
var enumeratorVarDef = new var_statement(enumeratorIdent, new method_call(new dot_node(foreachCollIdent, new ident("GetEnumerator")), new expression_list()));
|
||
|
||
//var curr := en.Current;
|
||
// Переменная цикла foreach. Есть три варианта:
|
||
// 1. foreach x in l do -> curr := en.Current;
|
||
// 2. foreach var x in l do -> var curr := en.Current;
|
||
// 3. foreach var x: T in l do -> var curr: T := en.Current;
|
||
var currentIdent = frch.identifier;
|
||
statement st = null;
|
||
|
||
var curExpr = new dot_node(enumeratorIdent, "Current");
|
||
|
||
// С типом
|
||
if (frch.type_name == null) // 1. foreach x in l do -> curr := en.Current;
|
||
{
|
||
st = new assign(currentIdent, curExpr);
|
||
}
|
||
else if (frch.type_name is no_type_foreach) // 2. foreach var x in l do -> var curr := en.Current;
|
||
{
|
||
// Получаем служебное имя с $ и заменяем его в теле цикла
|
||
currentIdent = this.NewVarNames(frch.identifier).VarName;
|
||
var replacerVis = new ReplaceVariableNameVisitor(frch.identifier, currentIdent);
|
||
frch.visit(replacerVis);
|
||
|
||
st = new var_statement(currentIdent, curExpr);
|
||
}
|
||
else // 3. foreach var x: T in l do -> var curr: T := en.Current;
|
||
{
|
||
// Получаем служебное имя с $ и заменяем его в теле цикла
|
||
currentIdent = this.NewVarNames(frch.identifier).VarName;
|
||
var replacerVis = new ReplaceVariableNameVisitor(frch.identifier, currentIdent);
|
||
frch.visit(replacerVis);
|
||
|
||
st = new var_statement(currentIdent, frch.type_name, curExpr);
|
||
}
|
||
|
||
// Добавляем тело цикла в stl
|
||
var stl = new statement_list(st);
|
||
ProcessNode(frch.stmt); // для обработки вложенных конструкций
|
||
stl.Add(frch.stmt);
|
||
|
||
var whileNode = new while_node(new method_call(new dot_node(enumeratorIdent, "MoveNext"), new expression_list()),
|
||
stl,
|
||
WhileCycleType.While);
|
||
|
||
var sq = SeqStatements(foreachCollVarDef, ass, enumeratorVarDef, whileNode);
|
||
|
||
ReplaceStatement(frch,sq);
|
||
|
||
visit(whileNode); // Lowering оставшегося whileNode
|
||
}
|
||
|
||
private expression CreateConditionFromCaseVariant(expression param, expression_list list)
|
||
{
|
||
var res = list.expressions.Aggregate(new bool_const(false) as expression, (acc, expr) =>
|
||
{
|
||
bin_expr currentExpr = null;
|
||
diapason_expr diap = expr as diapason_expr;
|
||
if (diap != null)
|
||
{
|
||
currentExpr = new bin_expr(new bin_expr(param, diap.left, Operators.GreaterEqual),
|
||
new bin_expr(param, diap.right, Operators.LessEqual),
|
||
Operators.LogicalAND);
|
||
}
|
||
else
|
||
{
|
||
currentExpr = new bin_expr(param, expr, Operators.Equal);
|
||
}
|
||
|
||
return new bin_expr(acc, currentExpr, Operators.LogicalOR);
|
||
});
|
||
|
||
return res;
|
||
}
|
||
|
||
// frninja 30/05/16
|
||
public override void visit(case_node csn)
|
||
{
|
||
var b = HasStatementVisitor<yield_node>.Has(csn);
|
||
if (!b)
|
||
return;
|
||
|
||
/*
|
||
*
|
||
* case i of
|
||
* cv1: bla1;
|
||
* cv2: bla2;
|
||
* ..
|
||
* cvN: blaN;
|
||
* else: bla_else;
|
||
*
|
||
* --->
|
||
*
|
||
* if i satisfy cv1
|
||
* then bla1
|
||
* else if i satisfy cv2
|
||
* then bla2
|
||
* ..
|
||
* else if i satisfy cvN
|
||
* then blaN
|
||
* else bla_else
|
||
*
|
||
*/
|
||
|
||
if_node currentIfNode = null;
|
||
statement currentIfElseClause = (csn.else_statement != null) ? csn.else_statement :new statement_list(new empty_statement()); ;
|
||
|
||
for (int i = csn.conditions.variants.Count - 1; i >= 0; --i)
|
||
{
|
||
case_variant cv = csn.conditions.variants[i];
|
||
|
||
ProcessNode(cv.exec_if_true);
|
||
|
||
var ifCondition = this.CreateConditionFromCaseVariant(csn.param, cv.conditions);
|
||
currentIfNode = new if_node(ifCondition, new statement_list(cv.exec_if_true), new statement_list(currentIfElseClause));
|
||
currentIfElseClause = currentIfNode;
|
||
}
|
||
|
||
if_node finalIfNode = currentIfNode;
|
||
|
||
if (finalIfNode==null) // SSM - значит, в цикл мы не заходили и у case отсутствуют все ветви кроме else - поскольку yieldы в case есть
|
||
{
|
||
ReplaceStatement(csn, csn.else_statement);
|
||
}
|
||
else
|
||
ReplaceStatement(csn, finalIfNode);
|
||
|
||
if (finalIfNode!=null)
|
||
visit(finalIfNode);
|
||
}
|
||
|
||
public override void visit(if_node ifn)
|
||
{
|
||
ProcessNode(ifn.then_body);
|
||
ProcessNode(ifn.else_body);
|
||
|
||
var b = HasStatementVisitor<yield_node>.Has(ifn);
|
||
if (!b)
|
||
return;
|
||
|
||
var gtAfter = GenerateGoto();
|
||
var lbAfter = new labeled_statement(gtAfter.label);
|
||
|
||
if ((object)ifn.else_body == null)
|
||
{
|
||
var if0 = new if_node(un_expr.Not(ifn.condition), gtAfter);
|
||
//Replace(ifn, SeqStatements(gotoStartIfCondition, ifn.then_body, lbAfter));
|
||
ReplaceStatement(ifn, SeqStatements(if0, ifn.then_body, lbAfter));
|
||
|
||
// в declarations ближайшего блока добавить описание labels
|
||
block bl = listNodes.FindLast(x => x is block) as block;
|
||
|
||
bl.defs.Add(new label_definitions(gtAfter.label));
|
||
}
|
||
else
|
||
{
|
||
var gtAlt = GenerateGoto();
|
||
var lbAlt = new labeled_statement(gtAlt.label, ifn.else_body);
|
||
|
||
var if0 = new if_node(un_expr.Not(ifn.condition), gtAlt);
|
||
|
||
ReplaceStatement(ifn, SeqStatements(if0, ifn.then_body, gtAfter, lbAlt, lbAfter));
|
||
|
||
// в declarations ближайшего блока добавить описание labels
|
||
block bl = listNodes.FindLast(x => x is block) as block;
|
||
|
||
bl.defs.Add(new label_definitions(gtAfter.label, gtAlt.label));
|
||
}
|
||
}
|
||
|
||
public override void visit(repeat_node rn)
|
||
{
|
||
var b = HasStatementVisitor<yield_node>.Has(rn);
|
||
if (!b)
|
||
return;
|
||
|
||
var gotoContinue = GenerateGoto();
|
||
var gotoBreak = GenerateGoto();
|
||
|
||
ReplaceBreakContinueWithGotoLabelVisitor replaceBreakContinueVis = new ReplaceBreakContinueWithGotoLabelVisitor(gotoContinue, gotoBreak);
|
||
rn.statements.visit(replaceBreakContinueVis);
|
||
|
||
ProcessNode(rn.statements);
|
||
|
||
var gotoContinueIfNotCondition = new if_node(un_expr.Not(rn.expr), gotoContinue);
|
||
var continueLabeledStatement = new labeled_statement(gotoContinue.label, new statement_list(rn.statements, gotoContinueIfNotCondition));
|
||
|
||
var breakLabeledStatement = new labeled_statement(gotoBreak.label);
|
||
|
||
|
||
ReplaceStatement(rn, SeqStatements(gotoContinue, continueLabeledStatement, breakLabeledStatement));
|
||
|
||
// в declarations ближайшего блока добавить описание labels
|
||
block bl = listNodes.FindLast(x => x is block) as block;
|
||
|
||
bl.defs.Add(new label_definitions(gotoContinue.label, gotoBreak.label));
|
||
|
||
}
|
||
|
||
public override void visit(while_node wn)
|
||
{
|
||
var b = HasStatementVisitor<yield_node>.Has(wn);
|
||
if (!b)
|
||
return;
|
||
|
||
var gotoBreak = GenerateGoto();
|
||
var gotoContinue = GenerateGoto();
|
||
|
||
ReplaceBreakContinueWithGotoLabelVisitor replaceBreakContinueVis = new ReplaceBreakContinueWithGotoLabelVisitor(gotoContinue, gotoBreak);
|
||
wn.statements.visit(replaceBreakContinueVis);
|
||
|
||
ProcessNode(wn.statements);
|
||
|
||
statement if0;
|
||
//if (wn.expr is ident && (wn.expr as ident).name.ToLower() == "true")
|
||
// if0 = gotoBreak;
|
||
//else
|
||
if0 = new if_node(un_expr.Not(wn.expr), gotoBreak);
|
||
var lb2 = new labeled_statement(gotoContinue.label, if0); // continue
|
||
var lb1 = new labeled_statement(gotoBreak.label); // break
|
||
|
||
ReplaceStatement(wn, SeqStatements(lb2, wn.statements, gotoContinue, lb1));
|
||
|
||
// в declarations ближайшего блока добавить описание labels
|
||
block bl = listNodes.FindLast(x => x is block) as block;
|
||
|
||
bl.defs.Add(new label_definitions(gotoBreak.label, gotoContinue.label));
|
||
}
|
||
|
||
public override void visit(function_lambda_definition fld)
|
||
{
|
||
// Нельзя Lowerить содержимое лямбды !!! Баг #1641!
|
||
}
|
||
|
||
public override void visit(for_node fn)
|
||
{
|
||
var b = HasStatementVisitor<yield_node>.Has(fn);
|
||
if (!b)
|
||
return;
|
||
|
||
var gotoContinue = GenerateGoto();
|
||
var gotoBreak = GenerateGoto();
|
||
var gotoStart = GenerateGoto();
|
||
|
||
ReplaceBreakContinueWithGotoLabelVisitor replaceBreakContinueVis = new ReplaceBreakContinueWithGotoLabelVisitor(gotoContinue, gotoBreak);
|
||
fn.statements.visit(replaceBreakContinueVis);
|
||
|
||
ProcessNode(fn.statements);
|
||
|
||
var newNames = this.NewVarNames(fn.loop_variable);
|
||
|
||
var newLoopVar = fn.create_loop_variable ? new ident(newNames.VarName) : fn.loop_variable;
|
||
|
||
// Нужно заменить fn.loop_variable -> newLoopVar в теле цикла
|
||
var replacerVis = new ReplaceVariableNameVisitor(fn.loop_variable, newLoopVar);
|
||
fn.visit(replacerVis);
|
||
|
||
fn.loop_variable = newLoopVar;
|
||
|
||
var endtemp = new ident(newNames.VarEndName); //new ident(newVarName());
|
||
|
||
//var ass1 = new var_statement(fn.loop_variable, fn.type_name, fn.initial_value);
|
||
//var ass1 = new var_statement(fn.loop_variable, fn.type_name, fn.initial_value);
|
||
//var ass2 = new var_statement(endtemp, fn.type_name, fn.finish_value);
|
||
|
||
// Исправления в связи с #1254 (новый алгоритм)
|
||
// цикл for i:=a to b do
|
||
// i := a
|
||
// if i > b then goto break
|
||
//Start: stmts
|
||
// if i >= b then goto break
|
||
//Continue: Inc(i)
|
||
// goto Start
|
||
//Break:
|
||
|
||
// цикл for i:=a downto b do
|
||
// i := a
|
||
// if i < b then goto break
|
||
//Start: stmts
|
||
// if i <= b then goto break
|
||
//Continue: Dec(i)
|
||
// goto Start
|
||
//Break:
|
||
|
||
// frninja 05/06/16 - фиксим для !fn.create_variable
|
||
var ass1 = fn.create_loop_variable
|
||
? new var_statement(fn.loop_variable, fn.type_name, fn.initial_value) as statement
|
||
: new assign(fn.loop_variable, fn.initial_value) as statement;
|
||
|
||
var if0 = new if_node((fn.cycle_type == for_cycle_type.to) ?
|
||
bin_expr.Greater(fn.loop_variable, fn.finish_value) :
|
||
bin_expr.Less(fn.loop_variable, fn.finish_value), gotoBreak);
|
||
|
||
var if1 = new if_node((fn.cycle_type == for_cycle_type.to) ?
|
||
bin_expr.GreaterEqual(fn.loop_variable, fn.finish_value) :
|
||
bin_expr.LessEqual(fn.loop_variable, fn.finish_value), gotoBreak);
|
||
|
||
var lb1 = new labeled_statement(gotoStart.label);
|
||
var lb2 = new labeled_statement(gotoBreak.label); // пустой оператор
|
||
var Inc = new procedure_call(new method_call((fn.cycle_type == for_cycle_type.to) ?
|
||
new ident("Inc") :
|
||
new ident("Dec"), new expression_list(fn.loop_variable)));
|
||
|
||
var lbInc = new labeled_statement(gotoContinue.label, Inc);
|
||
|
||
ReplaceStatement(fn, SeqStatements(ass1, if0, lb1, fn.statements, if1, lbInc, gotoStart, lb2));
|
||
|
||
/*var if0 = new if_node((fn.cycle_type == for_cycle_type.to) ?
|
||
bin_expr.Greater(fn.loop_variable, fn.finish_value) :
|
||
bin_expr.Less(fn.loop_variable, fn.finish_value), gotoBreak);
|
||
|
||
var lb2 = new labeled_statement(gotoStart.label, if0);
|
||
var lb1 = new labeled_statement(gotoBreak.label); // пустой оператор
|
||
var Inc = new procedure_call(new method_call((fn.cycle_type == for_cycle_type.to) ?
|
||
new ident("Inc") :
|
||
new ident("Dec"), new expression_list(fn.loop_variable)));
|
||
|
||
var lbInc = new labeled_statement(gotoContinue.label, Inc);
|
||
|
||
ReplaceStatement(fn, SeqStatements(ass1, lb2, fn.statements, lbInc, gotoStart, lb1));*/
|
||
|
||
// в declarations ближайшего блока добавить описание labels
|
||
block bl = listNodes.FindLast(x => x is block) as block;
|
||
|
||
bl.defs.Add(new label_definitions(gotoContinue.label, gotoBreak.label, gotoStart.label));
|
||
}
|
||
|
||
|
||
private goto_statement GenerateGoto()
|
||
{
|
||
return new goto_statement(generatedNamesManager.GenerateName("lb#"));
|
||
}
|
||
|
||
/*
|
||
public override void visit(for_node fn)
|
||
{
|
||
|
||
* initializer;
|
||
* goto end;
|
||
* start:
|
||
* body;
|
||
* continue:
|
||
* increment;
|
||
* end:
|
||
* GotoIfTrue condition start;
|
||
* break:
|
||
|
||
|
||
|
||
var b = HasStatementVisitor<yield_node>.Has(fn);
|
||
if (!b)
|
||
return;
|
||
|
||
var gotoStart = goto_statement.New;
|
||
var gotoEnd = goto_statement.New;
|
||
var gotoStart = goto_statement.New;
|
||
var gotoBreak = goto_statement.New;
|
||
|
||
ReplaceBreakContinueWithGotoLabelVisitor replaceBreakContinueVis = new ReplaceBreakContinueWithGotoLabelVisitor(gotoStart, gotoBreak);
|
||
fn.statements.visit(replaceBreakContinueVis);
|
||
|
||
ProcessNode(fn.statements);
|
||
|
||
|
||
var newNames = this.NewVarNames(fn.loop_variable);
|
||
|
||
var newLoopVar = fn.create_loop_variable ? new ident(newNames.VarName) : fn.loop_variable;
|
||
|
||
// Нужно заменить fn.loop_variable -> newLoopVar в теле цикла
|
||
var replacerVis = new ReplaceVariableNameVisitor(fn.loop_variable, newLoopVar);
|
||
fn.visit(replacerVis);
|
||
|
||
fn.loop_variable = newLoopVar;
|
||
|
||
var endtemp = new ident(newNames.VarEndName); //new ident(newVarName());
|
||
|
||
//var initializer = new var_statement(fn.loop_variable, fn.type_name, fn.initial_value);
|
||
//var initializer = new var_statement(fn.loop_variable, fn.type_name, fn.initial_value);
|
||
//var ass2 = new var_statement(endtemp, fn.type_name, fn.finish_value);
|
||
|
||
// frninja 05/06/16 - фиксим для !fn.create_variable
|
||
var initializer = fn.create_loop_variable
|
||
? new var_statement(fn.loop_variable, fn.type_name, fn.initial_value) as statement
|
||
: new assign(fn.loop_variable, fn.initial_value) as statement;
|
||
|
||
|
||
var gotoStartIfCondition = new if_node((fn.cycle_type == for_cycle_type.to) ?
|
||
new bin_expr(fn.loop_variable, fn.finish_value, Operators.LessEqual) :
|
||
new bin_expr(fn.loop_variable, fn.finish_value, Operators.GreaterEqual), gotoStart);
|
||
|
||
var endLabeledStatement = new labeled_statement(gotoEnd.label, gotoStartIfCondition);
|
||
var startLabeledStatement = new labeled_statement(gotoStart.label, fn.statements);
|
||
var Inc = new procedure_call(new method_call((fn.cycle_type == for_cycle_type.to) ?
|
||
new ident("Inc") :
|
||
new ident("Dec"), new expression_list(fn.loop_variable)));
|
||
|
||
var continueLabeledStatement = new labeled_statement(gotoStart.label, Inc);
|
||
var breakLabeledStatement = new labeled_statement(gotoBreak.label);
|
||
|
||
ReplaceStatement(fn, SeqStatements(initializer, gotoEnd, startLabeledStatement, continueLabeledStatement, endLabeledStatement, breakLabeledStatement));
|
||
|
||
// в declarations ближайшего блока добавить описание labels
|
||
block bl = listNodes.FindLast(x => x is block) as block;
|
||
|
||
bl.defs.Add(new label_definitions(gotoStart.label, gotoEnd.label, gotoStart.label, gotoBreak.label));
|
||
}*/
|
||
|
||
|
||
}
|
||
|
||
}
|