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
|
/************************************************************************
************************************************************************
FAUST compiler, boxIdentity source code
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 "boxIdentity.hh"
#include <stdlib.h>
#include <cstdlib>
#include "Text.hh"
#include "global.hh"
#include "ppbox.hh"
#include "signals.hh"
using namespace std;
//-------------------------BoxIdentity----------------------------------
// An identity transformation on 'flat' box circuits, after evaluation.
//----------------------------------------------------------------------
void BoxIdentity::traceEnter(Tree t)
{
tab(fIndent, cerr);
cerr << fMessage << ": " << boxpp(t, MAX_ERROR_SIZE) << endl;
}
void BoxIdentity::traceExit(Tree t, Tree r)
{
tab(fIndent, cerr);
cerr << fMessage << ": " << boxpp(t, MAX_ERROR_SIZE) << " => " << boxpp(r, MAX_ERROR_SIZE)
<< endl;
}
Tree BoxIdentity::transformation(Tree box)
{
int i;
double r;
Tree x, y, z, c, slot, body, label;
// GENERATORS
if (isBoxInt(box, &i)) {
return box;
} else if (isBoxReal(box, &r)) {
return box;
} else if (isBoxWaveform(box)) {
return box;
} else if (isBoxSoundfile(box)) {
return box;
}
// ROUTING
else if (isBoxRoute(box, x, y, z)) {
return box;
} else if (isBoxWire(box)) {
return box;
} else if (isBoxCut(box)) {
return box;
}
// SLOTS AND SYMBOLIC BOXES
else if (isBoxSlot(box)) {
return box;
} else if (isBoxSymbolic(box, slot, body)) {
return boxSymbolic(self(slot), self(body));
}
// COMPOSITION ALGEBRA
else if (isBoxSeq(box, x, y)) {
return boxSeq(self(x), self(y));
} else if (isBoxPar(box, x, y)) {
return boxPar(self(x), self(y));
} else if (isBoxRec(box, x, y)) {
return boxRec(self(x), self(y));
} else if (isBoxSplit(box, x, y)) {
return boxSplit(self(x), self(y));
} else if (isBoxMerge(box, x, y)) {
return boxMerge(self(x), self(y));
}
// MODULATION
else if (isBoxModulation(box, x, y)) {
return boxModulation(self(x), self(y));
}
// PRIMITIVE OPERATIONS
else if (isBoxPrim0(box)) {
return box;
} else if (isBoxPrim1(box)) {
return box;
} else if (isBoxPrim2(box)) {
return box;
} else if (isBoxPrim3(box)) {
return box;
} else if (isBoxPrim4(box)) {
return box;
} else if (isBoxPrim5(box)) {
return box;
}
// FOREIGN FUNCTIONS
else if (isBoxFFun(box)) {
return box;
} else if (isBoxFConst(box)) {
return box;
} else if (isBoxFVar(box)) {
return box;
}
// UI WIDGETS
else if (isBoxButton(box, label)) {
return box;
} else if (isBoxCheckbox(box, label)) {
return box;
} else if (isBoxVSlider(box, label, c, x, y, z)) {
return boxVSlider(label, self(c), self(x), self(y), self(z));
} else if (isBoxHSlider(box, label, c, x, y, z)) {
return boxHSlider(label, self(c), self(x), self(y), self(z));
} else if (isBoxNumEntry(box, label, c, x, y, z)) {
return boxNumEntry(label, self(c), self(x), self(y), self(z));
} else if (isBoxVBargraph(box, label, x, y)) {
return boxVBargraph(label, self(x), self(y));
} else if (isBoxHBargraph(box, label, x, y)) {
return boxHBargraph(label, self(x), self(y));
}
// UI GROUPS
else if (isBoxVGroup(box, label, x)) {
return boxVGroup(label, self(x));
} else if (isBoxHGroup(box, label, x)) {
return boxHGroup(label, self(x));
} else if (isBoxTGroup(box, label, x)) {
return boxTGroup(label, self(x));
}
// Other boxes here should be extended primitives
return box;
}
|
