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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/************************************************************************
************************************************************************
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 General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
************************************************************************
************************************************************************/
/*****************************************************************************
******************************************************************************
FAUST SIGNAL COMPILER
Y. Orlarey, (c) Grame 2002
------------------------------------------------------------------------------
Compile a list of FAUST signals into a C++ class.
History :
---------
2002-02-08 : First version
******************************************************************************
*****************************************************************************/
#include <stdio.h>
#include "compile_scal.hh"
#include "compile_vect.hh"
#include "dcond.hh"
#include "ppsig.hh"
#include "property.hh"
#include "sigprint.hh"
#include "sigtype.hh"
#include "sigtyperules.hh"
/*****************************************************************************
******************************************************************************
SHARING ANALYSIS
******************************************************************************
*****************************************************************************/
//------------------------------------------------------------------------------
// Create a specific property key for the sharing count of subtrees of t
//------------------------------------------------------------------------------
int ScalarCompiler::getSharingCount(Tree sig)
{
// cerr << "getSharingCount of : " << *sig << " = ";
Tree c;
if (getProperty(sig, fSharingKey, c)) {
// cerr << c->node().getInt() << endl;
return c->node().getInt();
} else {
// cerr << 0 << endl;
return 0;
}
}
void ScalarCompiler::setSharingCount(Tree sig, int count)
{
// cerr << "setSharingCount of : " << *sig << " <- " << count << endl;
setProperty(sig, fSharingKey, tree(count));
}
//------------------------------------------------------------------------------
// Create a specific property key for the sharing count of subtrees of t
//------------------------------------------------------------------------------
void ScalarCompiler::sharingAnalysis(Tree t)
{
fSharingKey = shprkey(t);
if (isList(t)) {
while (isList(t)) {
sharingAnnotation(kSamp, hd(t));
t = tl(t);
}
} else {
sharingAnnotation(kSamp, t);
}
}
//------------------------------------------------------------------------------
// Create a specific property key for the sharing count of subtrees of t
//------------------------------------------------------------------------------
void ScalarCompiler::sharingAnnotation(int vctxt, Tree sig)
{
Tree c, x, y, z;
// cerr << "START sharing annotation of " << *sig << endl;
int count = getSharingCount(sig);
if (count > 0) {
// it is not our first visit
setSharingCount(sig, count + 1);
} else {
// it is our first visit,
int v = getCertifiedSigType(sig)->variability();
// check "time sharing" cases
if (v < vctxt) {
setSharingCount(sig, 2); // time sharing occurence : slower expression in faster context
} else {
setSharingCount(sig, 1); // regular occurence
}
if (isSigSelect3(sig, c, y, x, z)) {
// make a special case for select3 implemented with real if
// because the c expression will be used twice in the C++
// translation
sharingAnnotation(v, c);
sharingAnnotation(v, c);
sharingAnnotation(v, x);
sharingAnnotation(v, y);
sharingAnnotation(v, z);
} else {
// Annotate the sub signals
vector<Tree> subsig;
int n = getSubSignals(sig, subsig);
if (n > 0 && !isSigGen(sig)) {
for (int i = 0; i < n; i++) sharingAnnotation(v, subsig[i]);
}
}
}
// cerr << "END sharing annotation of " << *sig << endl;
}
//------------------------------------------------------------------------------
// Condition annotation due to enabled expressions
//------------------------------------------------------------------------------
#if 0
void ScalarCompiler::conditionStatistics(Tree l)
{
for (const auto& p : fConditionProperty) {
fConditionStatistics[p.second]++;
}
std::cout << "\nConditions statistics" << std::endl;
for (const auto& p : fConditionStatistics) {
std::cout << ppsig(p.first) << ":" << p.second << std::endl;
}
}
#endif
void ScalarCompiler::conditionStatistics(Tree l)
{
map<Tree, int> fConditionStatistics; // used with the new X,Y:enable --> sigEnable(X*Y,Y>0) primitive
for (const auto& p : fConditionProperty) {
for (Tree lc = p.second; !isNil(lc); lc = tl(lc)) {
fConditionStatistics[hd(lc)]++;
}
}
std::cout << "\nConditions statistics" << std::endl;
for (const auto& p : fConditionStatistics) {
std::cout << ppsig(p.first) << ":" << p.second << std::endl;
}
}
void ScalarCompiler::conditionAnnotation(Tree l)
{
while (isList(l)) {
conditionAnnotation(hd(l), gGlobal->nil);
l = tl(l);
}
}
#if _DNF_
#define _OR_ dnfOr
#define _AND_ dnfAnd
#define _CND_ dnfCond
#else
#define _OR_ cnfOr
#define _AND_ cnfAnd
#define _CND_ cnfCond
#endif
void ScalarCompiler::conditionAnnotation(Tree t, Tree nc)
{
// Check if we need to annotate the tree with new conditions
auto p = fConditionProperty.find(t);
if (p != fConditionProperty.end()) {
Tree cc = p->second;
Tree xc = _OR_(cc, nc);
if (cc == xc) {
// Tree t already correctly annotated, nothing to change
return;
} else {
// we need to re-annotate the tree with a new condition
nc = xc;
p->second = nc;
}
} else {
// first visit
fConditionProperty[t] = nc;
}
// Annotate the subtrees with the new condition nc
// which is either the nc passed as argument or nc <- (cc v nc)
Tree x, y;
if (isSigEnable(t, x, y)) {
// specific annotation case for sigEnable
conditionAnnotation(y, nc);
conditionAnnotation(x, _AND_(nc, _CND_(y)));
} else {
// general annotation case
// Annotate the sub signals with nc
vector<Tree> subsig;
int n = getSubSignals(t, subsig);
if (n > 0 && !isSigGen(t)) {
for (int i = 0; i < n; i++) conditionAnnotation(subsig[i], nc);
}
}
}
|
