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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
|
/************************************************************************
************************************************************************
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.
************************************************************************
************************************************************************/
#ifndef _CPP_CODE_CONTAINER_H
#define _CPP_CODE_CONTAINER_H
#include "code_container.hh"
#include "cpp_instructions.hh"
#include "dsp_factory.hh"
#include "omp_code_container.hh"
#include "opencl_instructions.hh"
#include "vec_code_container.hh"
#include "wss_code_container.hh"
#ifdef WIN32
#pragma warning(disable : 4250)
#endif
/**
* Implement C++ FIR base container.
*/
class CPPCodeContainer : public virtual CodeContainer {
protected:
CPPInstVisitor* fCodeProducer;
std::ostream* fOut;
std::string fSuperKlassName;
void produceMetadata(int tabs);
void produceInit(int tabs);
std::string genVirtual();
std::string genFinal();
inline bool isPtr(const std::string& type)
{
return (type == "kFloat_ptr" || type == "kDouble_ptr" || type == "kQuad_ptr" ||
type == "kInt32_ptr" || type == "kObj_ptr");
}
void generateHeader(int n)
{
tab(n, *fOut);
*fOut << "#ifndef FAUSTCLASS " << std::endl;
*fOut << "#define FAUSTCLASS " << fKlassName << std::endl;
*fOut << "#endif" << std::endl;
tab(n, *fOut);
*fOut << "#ifdef __APPLE__ " << std::endl;
*fOut << "#define exp10f __exp10f" << std::endl;
*fOut << "#define exp10 __exp10" << std::endl;
*fOut << "#endif" << std::endl;
tab(n, *fOut);
*fOut << "#if defined(_WIN32)" << std::endl;
*fOut << "#define RESTRICT __restrict" << std::endl;
*fOut << "#else" << std::endl;
*fOut << "#define RESTRICT __restrict__" << std::endl;
*fOut << "#endif" << std::endl;
}
void generateAllocateFun(int n)
{
if (fAllocateInstructions->fCode.size() > 0) {
tab(n + 1, *fOut);
*fOut << "void allocate() {";
tab(n + 2, *fOut);
fCodeProducer->Tab(n + 2);
generateAllocate(fCodeProducer);
back(1, *fOut);
*fOut << "}";
tab(n + 1, *fOut);
}
}
void printMathHeader()
{
// For mathematical functions
if (gGlobal->gFastMathLib != "") {
includeFastMath();
} else {
addIncludeFile("<cmath>");
addIncludeFile("<algorithm>");
// For int64_t type
addIncludeFile("<cstdint>");
}
}
void generateDestroyFun(int n)
{
if (fDestroyInstructions->fCode.size() > 0) {
tab(n + 1, *fOut);
*fOut << "void destroy() {";
tab(n + 2, *fOut);
fCodeProducer->Tab(n + 2);
generateDestroy(fCodeProducer);
back(1, *fOut);
*fOut << "}";
tab(n + 1, *fOut);
}
}
void generateConstructor(const std::string& fun_proto, int n)
{
if (fAllocateInstructions->fCode.size() > 0) {
tab(n + 1, *fOut);
*fOut << fun_proto << " {";
tab(n + 2, *fOut);
*fOut << "allocate();";
} else {
tab(n + 1, *fOut);
*fOut << fun_proto << " {";
}
}
void generateDestructor(int n)
{
if (fDestroyInstructions->fCode.size() > 0) {
tab(n + 1, *fOut);
*fOut << "virtual ~" << fKlassName << "() {";
tab(n + 2, *fOut);
*fOut << "destroy();";
tab(n + 1, *fOut);
*fOut << "}" << std::endl;
}
}
public:
CPPCodeContainer() {}
CPPCodeContainer(const std::string& name, const std::string& super, int numInputs,
int numOutputs, std::ostream* out)
: fSuperKlassName(super)
{
initialize(numInputs, numOutputs);
fKlassName = name;
fOut = out;
printMathHeader();
fCodeProducer = new CPPInstVisitor(out, "");
}
virtual ~CPPCodeContainer()
{
// fCodeProducer is a 'Garbageable'
}
virtual void produceClass();
virtual void generateCompute(int tab) = 0;
virtual void produceInternal();
virtual dsp_factory_base* produceFactory();
virtual void printHeader()
{
CodeContainer::printHeader(*fOut);
tab(0, *fOut);
*fOut << "#ifndef __" << gGlobal->gClassName << "_H__";
tab(0, *fOut);
*fOut << "#define __" << gGlobal->gClassName << "_H__" << std::endl << std::endl;
}
virtual void printFloatDef() { printfloatdef(*fOut); }
virtual void printFooter()
{
tab(0, *fOut);
*fOut << "#endif" << std::endl;
}
CodeContainer* createScalarContainer(const std::string& name, int sub_container_type);
static CodeContainer* createScalarContainer(const std::string& name, const std::string& super,
int numInputs, int numOutputs, std::ostream* dst,
int sub_container_type);
static CodeContainer* createContainer(const std::string& name, const std::string& super,
int numInputs, int numOutputs,
std::ostream* dst = new std::stringstream());
};
/**
* Implement C++ FIR scalar container.
*/
class CPPScalarCodeContainer : public CPPCodeContainer {
protected:
public:
CPPScalarCodeContainer() {}
CPPScalarCodeContainer(const std::string& name, const std::string& super, int numInputs,
int numOutputs, std::ostream* out, int sub_container_type);
virtual ~CPPScalarCodeContainer() {}
void generateCompute(int tab);
};
/**
Implement C++ FIR vector container.
*/
class CPPVectorCodeContainer : public VectorCodeContainer, public CPPCodeContainer {
protected:
public:
CPPVectorCodeContainer(const std::string& name, const std::string& super, int numInputs,
int numOutputs, std::ostream* out);
virtual ~CPPVectorCodeContainer() {}
void generateCompute(int tab);
};
/**
Implement C++ FIR OpenMP container.
*/
class CPPOpenMPCodeContainer : public OpenMPCodeContainer, public CPPCodeContainer {
protected:
public:
CPPOpenMPCodeContainer(const std::string& name, const std::string& super, int numInputs,
int numOutputs, std::ostream* out);
virtual ~CPPOpenMPCodeContainer() {}
void generateCompute(int tab);
};
/**
Implement C++ FIR Work Stealing container.
*/
class CPPWorkStealingCodeContainer : public WSSCodeContainer, public CPPCodeContainer {
protected:
public:
CPPWorkStealingCodeContainer(const std::string& name, const std::string& super, int numInputs,
int numOutputs, std::ostream* out);
virtual ~CPPWorkStealingCodeContainer() {}
void produceClass();
void generateCompute(int tab);
};
#endif
|
