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
|
/************************************************************************
************************************************************************
FAUST compiler
Copyright (C) 2003-2018 GRAME, Centre National de Creation Musicale
---------------------------------------------------------------------
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 "sigConstantPropagation.hh"
#include <stdlib.h>
#include <cstdlib>
#include "signals.hh"
#include "xtended.hh"
/********************************************************************
SignalConstantPropagation::transformation(Tree sig) :
Computes constant expressions
**********************************************************************/
Tree SignalConstantPropagation::transformation(Tree sig)
{
faustassert(sig);
int opnum, i;
Tree t1, t2, t3, x, y;
xtended* xt = (xtended*)getUserData(sig);
// primitive elements
if (xt) {
vector<Tree> newBranches;
bool allNums = true;
for (Tree b : sig->branches()) {
Tree c = self(b);
newBranches.push_back(c);
allNums &= isNum(c);
}
if (allNums) {
return xt->computeSigOutput(newBranches);
} else {
return tree(sig->node(), newBranches);
}
} else if (isSigDelay1(sig, x)) {
Tree v = self(x);
if (isZero(v)) {
return v;
} else {
return sigDelay1(v);
}
} else if (isSigDelay(sig, x, y)) {
Tree v = self(x);
Tree w = self(y);
if (isZero(v)) {
return v;
} else if (isNum(v) && isZero(w)) {
return v;
} else {
return sigDelay(v, w);
}
} else if (isSigBinOp(sig, &opnum, t1, t2)) {
BinOp* op = gBinOpTable[opnum];
Tree v1 = self(t1);
Tree v2 = self(t2);
Node n1 = v1->node();
Node n2 = v2->node();
if (isNum(n1) && isNum(n2))
return tree(op->compute(n1, n2));
else if (op->isLeftNeutral(n1))
return v2;
else if (op->isLeftAbsorbing(n1))
return v1;
else if (op->isRightNeutral(n2))
return v1;
else if (op->isRightAbsorbing(n2))
return v2;
else
return sigBinOp(opnum, v1, v2);
} else if (isSigSelect2(sig, t1, t2, t3)) {
Tree v1 = self(t1);
Tree v2 = self(t2);
Tree v3 = self(t3);
Node n1 = v1->node();
if (isZero(n1)) return v2;
if (isNum(n1)) return v3;
if (v2 == v3) return v2;
return sigSelect2(v1, v2, v3);
} else if (isProj(sig, &i, x)) {
Tree r = self(x);
Tree id, le;
if (isRec(r, id, le)) {
Tree v = nth(le, i);
if (isNum(v)) {
return v;
} else {
return sigProj(i, r);
}
} else {
cerr << "ERROR : SignalConstantPropagation::transformation : " << *sig << endl;
faustassert(false);
return gGlobal->nil; // Fake return to silence warnings
}
} else {
return SignalIdentity::transformation(sig);
}
}
// Public API
Tree constantPropagation(Tree sig, bool trace)
{
SignalConstantPropagation SK;
if (trace) SK.trace(true, "ConstProp");
return SK.mapself(sig);
}
|
