luau-lang/luau
1
0
Fork 0
mirror of https://github.com/luau-lang/luau.git synced 2025-04-10 22:00:54 +01:00
Code Issues Projects Releases Packages Wiki Activity

Change propositional language to make use of NODE_ARRAY.

Browse source
This commit is contained in:
Alexander McCord 2024-06-02 17:37:16 -07:00
parent bf62839634
commit 7ba2821982
1 changed files with 15 additions and 23 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

38
tests/EqSat.propositional.test.cpp
View file

@ -9,18 +9,10 @@
LUAU_EQSAT_ATOM(Var, std::string); LUAU_EQSAT_ATOM(Var, std::string);
LUAU_EQSAT_ATOM(Bool, bool); LUAU_EQSAT_ATOM(Bool, bool);
LUAU_EQSAT_NODE_ARRAY(Not, 1);
LUAU_EQSAT_FIELD(Negated); LUAU_EQSAT_NODE_ARRAY(And, 2);
LUAU_EQSAT_NODE_FIELDS(Not, Negated); LUAU_EQSAT_NODE_ARRAY(Or, 2);
LUAU_EQSAT_NODE_ARRAY(Implies, 2);
LUAU_EQSAT_FIELD(Left);
LUAU_EQSAT_FIELD(Right);
LUAU_EQSAT_NODE_FIELDS(And, Left, Right);
LUAU_EQSAT_NODE_FIELDS(Or, Left, Right);
LUAU_EQSAT_FIELD(Antecedent);
LUAU_EQSAT_FIELD(Consequent);
LUAU_EQSAT_NODE_FIELDS(Implies, Antecedent, Consequent);
using namespace Luau; using namespace Luau;
@ -44,7 +36,7 @@ struct ConstantFold
Data make(const EGraph& egraph, const Not& n) const Data make(const EGraph& egraph, const Not& n) const
{ {
Data data = egraph[n.field<Negated>()].data; Data data = egraph[n[0]].data;
if (data) if (data)
return !*data; return !*data;
@ -53,28 +45,28 @@ struct ConstantFold
Data make(const EGraph& egraph, const And& a) const Data make(const EGraph& egraph, const And& a) const
{ {
Data left = egraph[a.field<Left>()].data; Data l = egraph[a[0]].data;
Data right = egraph[a.field<Right>()].data; Data r = egraph[a[1]].data;
if (left && right) if (l && r)
return *left && *right; return *l && *r;
return std::nullopt; return std::nullopt;
} }
Data make(const EGraph& egraph, const Or& o) const Data make(const EGraph& egraph, const Or& o) const
{ {
Data left = egraph[o.field<Left>()].data; Data l = egraph[o[0]].data;
Data right = egraph[o.field<Right>()].data; Data r = egraph[o[1]].data;
if (left && right) if (l && r)
return *left || *right; return *l || *r;
return std::nullopt; return std::nullopt;
} }
Data make(const EGraph& egraph, const Implies& i) const Data make(const EGraph& egraph, const Implies& i) const
{ {
Data antecedent = egraph[i.field<Antecedent>()].data; Data antecedent = egraph[i[0]].data;
Data consequent = egraph[i.field<Consequent>()].data; Data consequent = egraph[i[1]].data;
if (antecedent && consequent) if (antecedent && consequent)
return !*antecedent || *consequent; return !*antecedent || *consequent;