1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/************************************************************************
************************************************************************
FAUST compiler
Copyright (C) 2023 INRIA
---------------------------------------------------------------------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
************************************************************************
************************************************************************/
#include <iostream>
#include <string>
#include "Schedule.hh"
#include "global.hh"
#include "ppsig.hh"
#include "sigDependenciesGraph.hh"
#include "sigIdentity.hh"
#include "sigNewConstantPropagation.hh"
#include "sigRecursiveDependencies.hh"
#include "signals.hh"
#include "sigtyperules.hh"
class SigNewConstantPropagation final : public SignalIdentity {
protected:
virtual Tree transformation(Tree sig) override;
virtual Tree postprocess(
Tree) override; // modify a tree after the transformation of its children
};
static void explainInterval(Tree sig)
{
digraph<Tree> G = fullGraph(list1(sig));
schedule<Tree> S = dfcyclesschedule(G);
int i = 0;
std::cerr << "\n\n EXPLAIN INTERVAL: " << getCertifiedSigType(sig)->getInterval()
<< " FOR SIGNAL " << sig << " = " << ppsig(sig, 10) << std::endl;
for (Tree s : S.elements()) {
Type Ty = getSigType(s);
if (Ty.pointee() == nullptr) {
std::cerr << "\n"
<< ++i << "@" << s << " : "
<< "NOTYPE"
<< "; sig = " << ppsig(s, 10) << std::endl;
} else {
std::cerr << "\n"
<< ++i << "@" << s << " : " << Ty->getInterval() << "; sig = " << ppsig(s, 10)
<< std::endl;
}
}
}
Tree SigNewConstantPropagation::transformation(Tree sig)
{
Type tt = getCertifiedSigType(sig);
interval I = tt->getInterval();
Tree res;
if (I.isconst()) {
if (tt->nature() == kInt) {
res = sigInt(int(I.lo()));
} else {
res = sigReal(I.lo());
}
Tree exp;
// We want to keep the sigGen indication, we don't want
// sigGen(2) to be replaced by 2
if (isSigGen(sig, exp)) {
res = sigGen(res);
// std::cerr << "Special sigGen case " << ppsig(sig) << " ===> " << ppsig(res) <<
// std::endl;
}
} else {
res = SignalIdentity::transformation(sig);
}
// if (res != sig) {
// std::cerr << "\n\nConstant propagation: " << ppsig(sig, 10) << " ==> " << ppsig(res, 10)
// << std::endl; explainInterval(sig);
// }
return res;
}
/**
* @brief simplify numerical expressions
*
* @param sig
* @return Tree
*/
Tree SigNewConstantPropagation::postprocess(Tree sig)
{
int opnum;
Tree t1, t2;
if (isSigBinOp(sig, &opnum, t1, t2)) {
BinOp* op = gBinOpTable[opnum];
Node n1 = t1->node();
Node n2 = t2->node();
if (isNum(n1) && isNum(n2)) {
// std::cerr << "\nnumop\n" << std::endl;
return tree(op->compute(n1, n2));
} else if (op->isLeftNeutral(n1)) {
// std::cerr << "\nleft neutral\n" << std::endl;
return t2;
} else if (op->isLeftAbsorbing(n1)) {
// std::cerr << "\nleft absorbing\n" << std::endl;
return t1;
} else if (op->isRightNeutral(n2)) {
// std::cerr << "\nright neutral\n" << std::endl;
return t1;
} else if (op->isRightAbsorbing(n2)) {
// std::cerr << "\nright absorbing\n" << std::endl;
return t2;
} else if (t1 == t2) {
if ((opnum == kAND) || (opnum == kOR)) {
// std::cerr << "\nAnd or Or\n" << std::endl;
return t1;
}
if ((opnum == kGE) || (opnum == kLE) || (opnum == kEQ)) {
// std::cerr << "\nGE, LE or EQ\n" << std::endl;
return sigInt(1);
}
if ((opnum == kGT) || (opnum == kLT) || (opnum == kNE) || (opnum == kRem) ||
(opnum == kXOR)) {
// std::cerr << "\nGT LT NE REM XOR\n" << std::endl;
return sigInt(0);
}
}
return sig;
}
return sig;
}
/**
* @brief
*
* @param sig
* @param trace
* @return Tree
*/
Tree newConstantPropagation(Tree sig, bool trace)
{
SigNewConstantPropagation cp;
cp.trace(trace);
if (isList(sig)) {
return cp.mapself(sig);
} else {
return cp.self(sig);
}
}
|
