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
|
/************************************************************************
************************************************************************
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.
************************************************************************
************************************************************************/
#include <algorithm>
#include "fir_to_fir.hh"
using namespace std;
/*
Sort arrays by size
*/
bool sortArrayDeclarations(StatementInst* a, StatementInst* b)
{
DeclareVarInst* inst1 = dynamic_cast<DeclareVarInst*>(a);
DeclareVarInst* inst2 = dynamic_cast<DeclareVarInst*>(b);
if (inst1) {
ArrayTyped* array_typed1 = dynamic_cast<ArrayTyped*>(inst1->fType);
if (array_typed1) {
if (inst2) {
ArrayTyped* array_typed2 = dynamic_cast<ArrayTyped*>(inst2->fType);
if (array_typed2) {
return (array_typed1->fSize == array_typed2->fSize)
? (intptr_t)array_typed1 > (intptr_t)array_typed1
: array_typed1->fSize > array_typed2->fSize;
}
}
return true;
} else {
return false;
}
} else if (inst2) {
ArrayTyped* array_typed = dynamic_cast<ArrayTyped*>(inst2->fType);
return (array_typed) ? (array_typed->fSize > 0) : false;
} else {
return false;
}
}
/*
Sort arrays by type : integer is moved first
*/
bool sortTypeDeclarations(StatementInst* a, StatementInst* b)
{
DeclareVarInst* inst1 = dynamic_cast<DeclareVarInst*>(a);
DeclareVarInst* inst2 = dynamic_cast<DeclareVarInst*>(b);
if (inst1 && inst2) {
return (inst1->fType->getType() == Typed::kInt32) || (inst1->fType->getType() == Typed::kInt32_ptr);
} else {
return false;
}
}
// Expand and rewrite ControlInst as 'IF (cond) {....}' instructions
void ControlExpander::beginCond(ControlInst* inst)
{
faustassert(fIfBlockStack.top().fCond == nullptr);
faustassert(fIfBlockStack.top().fIfInst == nullptr);
fIfBlockStack.top().fCond = inst->fCond;
fIfBlockStack.top().fIfInst = new IfInst(inst->fCond->clone(this), new BlockInst(), new BlockInst());
fIfBlockStack.top().fIfInst->fThen->pushBackInst(inst->fStatement->clone(this));
}
void ControlExpander::continueCond(ControlInst* inst)
{
faustassert(fIfBlockStack.top().fIfInst != nullptr);
fIfBlockStack.top().fIfInst->fThen->pushBackInst(inst->fStatement->clone(this));
}
void ControlExpander::endCond()
{
faustassert(fBlockStack.top() != nullptr);
if (fIfBlockStack.size() > 0 && fIfBlockStack.top().fIfInst) {
fBlockStack.top()->pushBackInst(fIfBlockStack.top().fIfInst);
fIfBlockStack.top().init();
}
}
StatementInst* ControlExpander::visit(ControlInst* inst)
{
if (!fIfBlockStack.top().fCond) {
beginCond(inst);
} else if (inst->hasCondition(fIfBlockStack.top().fCond)) {
continueCond(inst);
} else {
endCond();
beginCond(inst);
}
// Not used
return nullptr;
}
StatementInst* ControlExpander::visit(BlockInst* inst)
{
BlockInst* cloned = new BlockInst();
fBlockStack.push(cloned);
fIfBlockStack.push(IfBlock());
for (auto& it : inst->fCode) {
if (dynamic_cast<ControlInst*>(it)) {
// ControlInst will progressively fill the current block by side effect
it->clone(this);
} else {
endCond();
cloned->pushBackInst(it->clone(this));
}
}
// Possibly end last IF
endCond();
fBlockStack.pop();
fIfBlockStack.pop();
return cloned;
}
|
