2019-07-28 23:53:15 +03:00
|
|
|
|
// Copyright (c) Ivan Bondarev, Stanislav Mikhalkovich (for details please see \doc\copyright.txt)
|
2017-02-19 16:29:24 +03:00
|
|
|
|
// This code is distributed under the GNU LGPL (for details please see \doc\license.txt)
|
|
|
|
|
|
using System;
|
2017-01-22 21:00:20 +03:00
|
|
|
|
using System.Collections.Generic;
|
|
|
|
|
|
using System.Linq;
|
|
|
|
|
|
using System.Text;
|
2026-03-08 18:30:33 +03:00
|
|
|
|
using PascalABCCompiler.CoreUtils;
|
2017-01-22 21:00:20 +03:00
|
|
|
|
using PascalABCCompiler.SyntaxTree;
|
|
|
|
|
|
|
|
|
|
|
|
namespace SyntaxVisitors.SugarVisitors
|
|
|
|
|
|
{
|
2020-08-16 12:03:35 +03:00
|
|
|
|
/// <summary>
|
|
|
|
|
|
/// А здесь не только замена кортежа - здесь оптимизация (a,b) := (1,2) и var (a,b) := (1,2)
|
|
|
|
|
|
/// </summary>
|
2017-01-22 21:00:20 +03:00
|
|
|
|
public class TupleVisitor : BaseChangeVisitor
|
|
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
public bool optimize_tuple_assign;
|
|
|
|
|
|
|
2026-03-08 18:30:33 +03:00
|
|
|
|
private readonly GeneratedNamesManager generatedNamesManager;
|
|
|
|
|
|
|
|
|
|
|
|
public TupleVisitor(bool optimize_tup_opt, GeneratedNamesManager generatedNamesManager)
|
2017-01-22 21:00:20 +03:00
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
optimize_tuple_assign = optimize_tup_opt;
|
2026-03-08 18:30:33 +03:00
|
|
|
|
this.generatedNamesManager = generatedNamesManager;
|
2017-01-22 21:00:20 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-08 18:30:33 +03:00
|
|
|
|
public static TupleVisitor Create(bool optimize_tup_opt, GeneratedNamesManager generatedNamesManager) => new TupleVisitor(optimize_tup_opt, generatedNamesManager);
|
|
|
|
|
|
|
|
|
|
|
|
private string UniqueName()
|
2023-05-16 15:36:00 +03:00
|
|
|
|
{
|
2026-03-08 18:30:33 +03:00
|
|
|
|
return generatedNamesManager.GenerateName("#tup_vis");
|
2023-05-16 15:36:00 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
2018-08-09 09:31:48 +03:00
|
|
|
|
public override void visit(read_accessor_name wn)
|
|
|
|
|
|
{
|
2018-12-05 11:36:45 +03:00
|
|
|
|
DefaultVisit(wn);
|
2018-08-09 09:31:48 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
2018-09-23 19:00:56 +03:00
|
|
|
|
public override void visit(unnamed_type_object u)
|
|
|
|
|
|
{
|
|
|
|
|
|
DefaultVisit(u);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public override void visit(name_assign_expr_list ne)
|
|
|
|
|
|
{
|
|
|
|
|
|
DefaultVisit(ne);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2018-09-23 22:38:39 +03:00
|
|
|
|
public override void visit(name_assign_expr ne)
|
|
|
|
|
|
{
|
|
|
|
|
|
DefaultVisit(ne);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2020-12-09 19:09:36 +03:00
|
|
|
|
public override void visit(labeled_statement ls)
|
|
|
|
|
|
{
|
|
|
|
|
|
var sl = new List<statement>();
|
|
|
|
|
|
sl.Add(new labeled_statement(ls.label_name, new empty_statement(), ls.source_context));
|
|
|
|
|
|
sl.Add(ls.to_statement);
|
|
|
|
|
|
ReplaceStatementUsingParent(ls, sl);
|
|
|
|
|
|
ProcessNode(ls.to_statement);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-05-16 15:36:00 +03:00
|
|
|
|
// Здесь раскрываются ситуации когда справа - кортеж с константами: var (a,b) := (1,2) и только это.
|
|
|
|
|
|
// Остальное раскрывается в AssignTuplesDesugarVisitor
|
2020-08-16 12:03:35 +03:00
|
|
|
|
public override void visit(assign_var_tuple assvartup)
|
|
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
if (assvartup.expr is tuple_node tn)
|
2020-08-16 12:03:35 +03:00
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
if (tn.el.expressions.All(ex => ex is const_node) && !tn.el.expressions.Any(ex => ex is nil_const))
|
2020-08-16 12:03:35 +03:00
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
var n = assvartup.idents.idents.Count();
|
|
|
|
|
|
if (n > tn.el.Count)
|
|
|
|
|
|
throw new SyntaxVisitorError("TOO_MANY_ELEMENTS_ON_LEFT_SIDE_OF_TUPLE_ASSIGNMENT", assvartup.idents[0]);
|
|
|
|
|
|
|
|
|
|
|
|
// Оптимизация, т.к. все - константы
|
|
|
|
|
|
var sl = new List<statement>();
|
|
|
|
|
|
for (var i = 0; i < n; i++)
|
|
|
|
|
|
{
|
|
|
|
|
|
var a = new var_statement(
|
|
|
|
|
|
assvartup.idents.idents[i],
|
|
|
|
|
|
tn.el.expressions[i],
|
|
|
|
|
|
assvartup.idents.idents[i].source_context);
|
|
|
|
|
|
sl.Add(a);
|
|
|
|
|
|
}
|
|
|
|
|
|
ReplaceStatementUsingParent(assvartup, sl);
|
2020-08-16 12:03:35 +03:00
|
|
|
|
}
|
2024-07-08 20:35:57 +03:00
|
|
|
|
else if (optimize_tuple_assign)
|
|
|
|
|
|
return;
|
|
|
|
|
|
else
|
|
|
|
|
|
DefaultVisit(assvartup);
|
2020-08-16 12:03:35 +03:00
|
|
|
|
}
|
|
|
|
|
|
else
|
|
|
|
|
|
{
|
|
|
|
|
|
DefaultVisit(assvartup);
|
|
|
|
|
|
}
|
2024-07-08 20:35:57 +03:00
|
|
|
|
|
2020-08-16 12:03:35 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public override void visit(assign_tuple asstup)
|
|
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
if (asstup.expr is tuple_node tn)
|
2023-05-16 15:36:00 +03:00
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
if (tn.el.expressions.All(ex => ex is const_node) && !tn.el.expressions.Any(ex => ex is nil_const))
|
2023-05-16 15:36:00 +03:00
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
var n = asstup.vars.variables.Count();
|
|
|
|
|
|
if (n > tn.el.Count)
|
|
|
|
|
|
throw new SyntaxVisitorError("TOO_MANY_ELEMENTS_ON_LEFT_SIDE_OF_TUPLE_ASSIGNMENT", asstup.vars.variables[0]);
|
|
|
|
|
|
|
|
|
|
|
|
// Оптимизация, т.к. все - константы
|
|
|
|
|
|
var sl = new List<statement>();
|
|
|
|
|
|
for (var i = 0; i < n; i++)
|
|
|
|
|
|
{
|
|
|
|
|
|
var a = new assign(asstup.vars.variables[i],
|
|
|
|
|
|
tn.el.expressions[i],
|
|
|
|
|
|
Operators.Assignment,
|
|
|
|
|
|
asstup.vars.variables[i].source_context);
|
|
|
|
|
|
sl.Add(a);
|
|
|
|
|
|
}
|
|
|
|
|
|
ReplaceStatementUsingParent(asstup, sl);
|
2023-05-16 15:36:00 +03:00
|
|
|
|
}
|
2024-07-08 20:35:57 +03:00
|
|
|
|
else if (optimize_tuple_assign)
|
|
|
|
|
|
return;
|
|
|
|
|
|
else if (!tn.el.expressions.Any(ex => ex is nil_const))
|
2023-05-16 15:36:00 +03:00
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
var n = asstup.vars.variables.Count();
|
|
|
|
|
|
if (n > tn.el.Count)
|
|
|
|
|
|
throw new SyntaxVisitorError("TOO_MANY_ELEMENTS_ON_LEFT_SIDE_OF_TUPLE_ASSIGNMENT", asstup.vars.variables[0]);
|
|
|
|
|
|
|
|
|
|
|
|
var sl = new List<statement>();
|
|
|
|
|
|
for (var i = 0; i < n; i++)
|
|
|
|
|
|
{
|
|
|
|
|
|
var temp_id = new ident(UniqueName(), tn.el.expressions[i].source_context);
|
|
|
|
|
|
var var_def = new var_def_statement(temp_id, tn.el.expressions[i], tn.el.expressions[i].source_context);
|
|
|
|
|
|
var a = new var_statement(var_def, tn.el.expressions[i].source_context);
|
|
|
|
|
|
sl.Add(a);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//for (var i = 0; i < n; i++)
|
|
|
|
|
|
for (var i = n - 1; i >= 0; i--)
|
|
|
|
|
|
{
|
|
|
|
|
|
var a = new assign(asstup.vars.variables[i],
|
|
|
|
|
|
(sl[i] as var_statement).var_def.vars.idents[0],
|
|
|
|
|
|
Operators.Assignment,
|
|
|
|
|
|
asstup.vars.variables[i].source_context);
|
|
|
|
|
|
sl.Add(a);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
ReplaceStatementUsingParent(asstup, sl);
|
2023-05-16 15:36:00 +03:00
|
|
|
|
}
|
2024-07-08 20:35:57 +03:00
|
|
|
|
else
|
|
|
|
|
|
DefaultVisit(asstup);
|
2023-05-16 15:36:00 +03:00
|
|
|
|
}
|
2020-08-16 12:03:35 +03:00
|
|
|
|
else
|
|
|
|
|
|
{
|
|
|
|
|
|
DefaultVisit(asstup);
|
|
|
|
|
|
}
|
2024-07-08 20:35:57 +03:00
|
|
|
|
|
2020-08-16 12:03:35 +03:00
|
|
|
|
}
|
2018-09-23 19:00:56 +03:00
|
|
|
|
|
2020-08-17 10:51:28 +03:00
|
|
|
|
public void ReplaceVarTupleDefStatementUsingParent(var_tuple_def_statement from, IEnumerable<var_def_statement> to)
|
|
|
|
|
|
{
|
|
|
|
|
|
foreach (var x in to)
|
|
|
|
|
|
x.Parent = from.Parent;
|
|
|
|
|
|
var sl = from.Parent as variable_definitions;
|
|
|
|
|
|
if (sl != null)
|
|
|
|
|
|
{
|
|
|
|
|
|
sl.ReplaceInList(from, to);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2023-05-16 15:36:00 +03:00
|
|
|
|
// А это по идее до begin - там немного другие узлы и внешний контекст
|
2020-08-17 10:51:28 +03:00
|
|
|
|
public override void visit(var_tuple_def_statement vtd)
|
|
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
if (vtd.inital_value is tuple_node tn) {
|
|
|
|
|
|
if (tn.el.expressions.All(ex => ex is const_node) && !tn.el.expressions.Any(ex => ex is nil_const))
|
2020-08-17 10:51:28 +03:00
|
|
|
|
{
|
2024-07-08 20:35:57 +03:00
|
|
|
|
var n = vtd.vars.idents.Count();
|
|
|
|
|
|
if (n > tn.el.Count)
|
|
|
|
|
|
throw new SyntaxVisitorError("TOO_MANY_ELEMENTS_ON_LEFT_SIDE_OF_TUPLE_ASSIGNMENT", vtd.vars.idents[0]);
|
|
|
|
|
|
|
|
|
|
|
|
var vd = new List<var_def_statement>();
|
|
|
|
|
|
for (var i = 0; i < n; i++)
|
|
|
|
|
|
{
|
|
|
|
|
|
var a = new var_def_statement(vtd.vars.idents[i],
|
|
|
|
|
|
tn.el.expressions[i],
|
|
|
|
|
|
vtd.vars.idents[i].source_context);
|
|
|
|
|
|
vd.Add(a);
|
|
|
|
|
|
}
|
|
|
|
|
|
ReplaceVarTupleDefStatementUsingParent(vtd, vd);
|
|
|
|
|
|
visit(vtd.inital_value);
|
2020-08-17 10:51:28 +03:00
|
|
|
|
}
|
2024-07-08 20:35:57 +03:00
|
|
|
|
else if (optimize_tuple_assign)
|
|
|
|
|
|
return;
|
|
|
|
|
|
else
|
|
|
|
|
|
DefaultVisit(vtd);
|
2020-08-17 10:51:28 +03:00
|
|
|
|
}
|
|
|
|
|
|
else
|
|
|
|
|
|
{
|
|
|
|
|
|
DefaultVisit(vtd);
|
|
|
|
|
|
}
|
2024-07-08 20:35:57 +03:00
|
|
|
|
|
2020-08-17 10:51:28 +03:00
|
|
|
|
}
|
|
|
|
|
|
|
2017-01-26 15:47:13 +03:00
|
|
|
|
public override void visit(tuple_node tup)
|
2017-01-22 21:00:20 +03:00
|
|
|
|
{
|
2019-05-16 15:42:16 +03:00
|
|
|
|
var dn = new dot_node(new dot_node(new ident("?System", tup.source_context), new ident("Tuple", tup.source_context), tup.source_context), new ident("Create", tup.source_context));
|
2017-01-22 21:00:20 +03:00
|
|
|
|
var mc = new method_call(dn, tup.el, tup.source_context);
|
|
|
|
|
|
|
2017-01-26 15:47:13 +03:00
|
|
|
|
//var sug = new sugared_expression(tup, mc, tup.source_context); - нет никакой семантической проверки - всё - на уровне синтаксиса!
|
2017-01-22 21:00:20 +03:00
|
|
|
|
|
2018-09-27 17:59:37 +03:00
|
|
|
|
//ReplaceUsingParent(tup, mc); - исправление #1199. Оказывается, ReplaceUsingParent и Replace не эквивалентны - у копии Parent на старого родителя
|
2018-09-25 20:35:43 +03:00
|
|
|
|
Replace(tup, mc);
|
2017-01-22 21:00:20 +03:00
|
|
|
|
visit(mc);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|