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
|
/************************************************************************
************************************************************************
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 _INSTRUCTIONS_COMPLEXITY_H
#define _INSTRUCTIONS_COMPLEXITY_H
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include "exception.hh"
#include "faust/gui/JSONUI.h"
#include "instructions.hh"
#include "typing_instructions.hh"
class InstComplexityVisitor : public DispatchVisitor {
private:
InstComplexity fIComp;
public:
using DispatchVisitor::visit;
InstComplexityVisitor() {}
virtual ~InstComplexityVisitor() {}
virtual void visit(Printable* inst) {}
virtual void visit(DeclareVarInst* inst)
{
fIComp.fDeclare++;
DispatchVisitor::visit(inst);
}
virtual void visit(LoadVarInst* inst)
{
fIComp.fLoad++;
DispatchVisitor::visit(inst);
}
virtual void visit(StoreVarInst* inst)
{
fIComp.fStore++;
DispatchVisitor::visit(inst);
}
virtual void visit(FloatNumInst* inst) { fIComp.fNumbers++; }
virtual void visit(Int32NumInst* inst) { fIComp.fNumbers++; }
virtual void visit(BoolNumInst* inst) { fIComp.fNumbers++; }
virtual void visit(DoubleNumInst* inst) { fIComp.fNumbers++; }
virtual void visit(BinopInst* inst)
{
fIComp.fBinop++;
Typed::VarType type1 = TypingVisitor::getType(inst->fInst1);
Typed::VarType type2 = TypingVisitor::getType(inst->fInst2);
if (isRealType(type1) || isRealType(type2)) {
fIComp.fBinopSymbolTable["Real(" + std::string(gBinOpTable[inst->fOpcode]->fName) +
")"]++;
} else {
fIComp
.fBinopSymbolTable["Int(" + std::string(gBinOpTable[inst->fOpcode]->fName) + ")"]++;
}
DispatchVisitor::visit(inst);
}
virtual void visit(CastInst* inst)
{
fIComp.fCast++;
DispatchVisitor::visit(inst);
}
virtual void visit(Select2Inst* inst)
{
fIComp.fSelect++;
DispatchVisitor::visit(inst);
}
// Needs a cost table for a set of standard functions?
virtual void visit(FunCallInst* inst)
{
fIComp.fFunctionSymbolTable[inst->fName]++;
fIComp.fMathop++;
DispatchVisitor::visit(inst);
}
virtual void visit(IfInst* inst)
{
fIComp.fSelect++;
inst->fCond->accept(this);
// Max of the 2 branches
InstComplexityVisitor then_branch;
inst->fThen->accept(&then_branch);
InstComplexityVisitor else_branch;
inst->fThen->accept(&else_branch);
// Takes the max of both then/else branches
if (then_branch.cost() > else_branch.cost()) {
fIComp = fIComp + then_branch.fIComp;
} else {
fIComp = fIComp + else_branch.fIComp;
}
}
virtual void visit(ForLoopInst* inst)
{
fIComp.fLoop++;
DispatchVisitor::visit(inst);
}
void dump(std::ostream* dst)
{
*dst << "Instructions complexity : ";
*dst << "Load = " << fIComp.fLoad << " Store = " << fIComp.fStore;
*dst << " Binop = " << fIComp.fBinop;
if (fIComp.fBinop > 0) {
*dst << " [ ";
for (const auto& it : fIComp.fBinopSymbolTable) {
if (it.second > 0) {
*dst << "{ " << it.first << " = " << it.second << " } ";
}
}
*dst << "]";
}
*dst << " Mathop = " << fIComp.fMathop;
if (fIComp.fMathop > 0) {
*dst << " [ ";
for (const auto& it : fIComp.fFunctionSymbolTable) {
if (it.second > 0) {
*dst << "{ " << it.first << " = " << it.second << " } ";
}
}
*dst << "]";
}
*dst << " Numbers = " << fIComp.fNumbers << " Declare = " << fIComp.fDeclare;
*dst << " Cast = " << fIComp.fCast << " Select = " << fIComp.fSelect
<< " Loop = " << fIComp.fLoop << "\n";
}
int cost()
{
// A polynom based on measured values
return 0;
}
InstComplexity getInstComplexity() { return fIComp; }
};
#endif
|
