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
|
/************************************************************************
************************************************************************
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 <stdlib.h>
#include <iostream>
#include <algorithm>
#include "global.hh"
#include "old_occurences.hh"
#include "recursivness.hh"
#include "sigtyperules.hh"
using namespace std;
/**
* Extended Variability with recursiveness indication
*/
static int xVariability(int v, int r)
{
// cerr << "xVariability (" << v << ", " << r << ")" << endl;
// faustassert(v < 3); // kKonst=0, kBlock=1, kSamp=2
// faustassert(r==0 | v==2);
if (r > 1) r = 1;
return std::min<int>(3, v + r);
}
//-------------------------------------------------
// Occurences methods
//-------------------------------------------------
int old_Occurences::getOccurence(int variability) const
{
return fOccurences[variability];
}
old_Occurences::old_Occurences(int v, int r, Tree xc) : fXVariability(xVariability(v, r))
{
for (int i = 0; i < 4; i++) fOccurences[i] = 0;
fMultiOcc = false;
fOutDelayOcc = false;
fMinDelay = 0;
fMaxDelay = 0;
fExecCondition = xc;
}
old_Occurences* old_Occurences::incOccurences(int v, int r, int d, Tree xc)
{
int ctxt = xVariability(v, r);
// assert (ctxt >= fXVariability);
fOccurences[ctxt] += 1;
fMultiOcc = fMultiOcc | (ctxt > fXVariability) | (fOccurences[ctxt] > 1);
if (d == 0) {
// cerr << "Occurence outside a delay " << endl;
fOutDelayOcc = true;
}
if (d > fMaxDelay) {
// cerr << "Max delay : " << fMaxDelay << " <- " << d << endl;
fMaxDelay = d;
}
// check if used in different execution conditions
if (fExecCondition != xc) {
fMultiOcc = true;
}
return this;
}
bool old_Occurences::hasMultiOccurences() const
{
return fMultiOcc;
}
bool old_Occurences::hasOutDelayOccurences() const
{
return fOutDelayOcc;
}
int old_Occurences::getMaxDelay() const
{
return fMaxDelay;
}
Tree old_Occurences::getExecCondition() const
{
return fExecCondition;
}
//--------------------------------------------------
// Mark and retrieve occurences of subtrees of root
//--------------------------------------------------
void old_OccMarkup::mark(Tree root)
{
fRootTree = root;
fPropKey = tree(unique("OCCURRENCES"));
if (isList(root)) {
while (isList(root)) {
// incOcc(kSamp, 1, hd(root));
incOcc(gGlobal->nil, kSamp, 0, 0, gGlobal->nil, hd(root));
root = tl(root);
}
// cerr << "END OF LIST IS " << *root << endl;
} else {
// incOcc(kSamp, 1, root);
incOcc(gGlobal->nil, kSamp, 0, 0, gGlobal->nil, root);
}
}
old_Occurences* old_OccMarkup::retrieve(Tree t)
{
return getOcc(t);
}
//------------------------------------------------------------------------------
// Increment the occurences of t within context v,r,d,xc and proceed recursively
// xc : exec condition expression
//------------------------------------------------------------------------------
void old_OccMarkup::incOcc(Tree env, int v, int r, int d, Tree xc, Tree t)
{
// Check if we have already visited this tree
old_Occurences* occ = getOcc(t);
if (occ == 0) {
// 1) We build initial occurence information
Type ty = getCertifiedSigType(t);
int v0 = ty->variability();
int r0 = getRecursivness(t);
// fConditions may have been initialized empty
Tree c0 = (fConditions.find(t) == fConditions.end()) ? gGlobal->nil : fConditions[t];
occ = new old_Occurences(v0, r0, c0);
setOcc(t, occ);
// We mark the subtrees of t
Tree x, y;
if (isSigDelay(t, x, y)) {
Type g2 = getCertifiedSigType(y);
int d2 = checkDelayInterval(g2);
faustassert(d2 >= 0);
incOcc(env, v0, r0, d2, c0, x);
incOcc(env, v0, r0, 0, c0, y);
} else if (isSigPrefix(t, y, x)) {
incOcc(env, v0, r0, 1, c0, x);
incOcc(env, v0, r0, 0, c0, y);
} else {
vector<Tree> br;
int n = getSubSignals(t, br);
if (n > 0 && !isSigGen(t)) {
for (int i = 0; i < n; i++) incOcc(env, v0, r0, 0, c0, br[i]);
}
}
}
occ->incOccurences(v, r, d, xc);
}
old_Occurences* old_OccMarkup::getOcc(Tree t)
{
Tree p = t->getProperty(fPropKey);
if (p) {
return (old_Occurences*)tree2ptr(p);
} else {
return 0;
}
}
void old_OccMarkup::setOcc(Tree t, old_Occurences* occ)
{
t->setProperty(fPropKey, tree(occ));
}
#if 0
/**
* return the position of a signal in the current recursive environment
* @param env the current recursive environment of the signal
* @param t signal we want to know the position
* @return the position in the recursive environment
*/
static int position(Tree env, Tree t, int p)
{
if (isNil(env)) return 0; // was not in the environment
if (hd(env) == t) return p;
else return position(tl(env), t, p+1);
}
#endif
|
