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
|
#include "loop.hh"
extern bool gVectorSwitch;
extern bool gOpenMPSwitch;
extern bool gOpenMPLoop;
using namespace std;
/**
* Print n tabs (for indentation purpose)
* @param n number of tabs to print
* @param fout output stream
*/
static void tab (int n, ostream& fout)
{
fout << '\n';
while (n--) fout << '\t';
}
/**
* Print a list of lines
* @param n number of tabs of indentation
* @param lines list of lines to be printed
* @param fout output stream
*/
static void printlines (int n, list<string>& lines, ostream& fout)
{
list<string>::iterator s;
for (s = lines.begin(); s != lines.end(); s++) {
tab(n, fout); fout << *s;
}
}
/**
* Create a recursive loop
* @param recsymbol the recursive symbol defined in this loop
* @param encl the enclosing loop
* @param size the number of iterations of the loop
*/
Loop::Loop(Tree recsymbol, Loop* encl, const string& size)
: fIsRecursive(true), fRecSymbolSet(singleton(recsymbol)), fEnclosingLoop(encl), fSize(size), fOrder(-1), fIndex(-1), fUseCount(0), fPrinted(0)
{}
/**
* Create a non recursive loop
* @param encl the enclosing loop
* @param size the number of iterations of the loop
*/
Loop::Loop(Loop* encl, const string& size)
: fIsRecursive(false), fRecSymbolSet(nil), fEnclosingLoop(encl), fSize(size), fOrder(-1), fIndex(-1), fUseCount(0), fPrinted(0)
{}
/**
* A loop with recursive dependencies can't be run alone.
* It must be included into another loop.
* returns true is this loop has recursive dependencies
* and must be included in an enclosing loop
*/
bool Loop::hasRecDependencyIn(Tree S)
{
Loop* l = this;
while ( l && isNil(setIntersection(l->fRecSymbolSet,S)) ) l=l->fEnclosingLoop;
return l != 0;
}
/**
* Test if a loop is empty that is if it contains no lines of code).
* @return true if the loop is empty
*/
bool Loop::isEmpty()
{
return fPreCode.empty() && fExecCode.empty() && fPostCode.empty() && (fExtraLoops.begin()==fExtraLoops.end());
}
/**
* Add a line of pre code (begin of the loop)
*/
void Loop::addPreCode (const string& str)
{
// cerr << this << "->addExecCode " << str << endl;
fPreCode.push_back(str);
}
/**
* Add a line of exec code
*/
void Loop::addExecCode (const string& str)
{
// cerr << this << "->addExecCode " << str << endl;
fExecCode.push_back(str);
}
/**
* Add a line of post exec code (end of the loop)
*/
void Loop::addPostCode (const string& str)
{
// cerr << this << "->addPostCode " << str << endl;
fPostCode.push_front(str);
}
/**
* Absorb a loop by copying its recursive dependencies, its loop dependencies
* and its lines of exec and post exec code.
* @param l the Loop to be absorbed
*/
void Loop::absorb (Loop* l)
{
// the loops must have the same number of iterations
assert(fSize == l->fSize);
fRecSymbolSet = setUnion(fRecSymbolSet, l->fRecSymbolSet);
// update loop dependencies by adding those from the absorbed loop
fBackwardLoopDependencies.insert(l->fBackwardLoopDependencies.begin(), l->fBackwardLoopDependencies.end());
// add the line of code of the absorbed loop
fPreCode.insert(fPreCode.end(), l->fPreCode.begin(), l->fPreCode.end());
fExecCode.insert(fExecCode.end(), l->fExecCode.begin(), l->fExecCode.end());
fPostCode.insert(fPostCode.begin(), l->fPostCode.begin(), l->fPostCode.end());
}
/**
* Print a loop (unless it is empty)
* @param n number of tabs of indentation
* @param fout output stream
*/
void Loop::println(int n, ostream& fout)
{
for (list<Loop*>::const_iterator s = fExtraLoops.begin(); s != fExtraLoops.end(); s++) {
(*s)->println(n, fout);
}
if (fPreCode.size()+fExecCode.size()+fPostCode.size() > 0) {
/* if (gVectorSwitch) {
tab(n,fout);
fout << ((fIsRecursive) ? "// recursive loop" : "// vectorizable loop");
}*/
tab(n,fout); fout << "// LOOP " << this ;
if (fPreCode.size()>0) {
tab(n,fout); fout << "// pre processing";
printlines(n, fPreCode, fout);
}
tab(n,fout); fout << "// exec code";
tab(n,fout); fout << "for (int i=0; i<" << fSize << "; i++) {";
printlines(n+1, fExecCode, fout);
tab(n,fout); fout << "}";
if (fPostCode.size()>0) {
tab(n,fout); fout << "// post processing";
printlines(n, fPostCode, fout);
}
tab(n,fout);
}
}
/**
* Print a parallel loop (unless it is empty). Should be called only for loop
* without pre and post processing
* @param n number of tabs of indentation
* @param fout output stream
*/
void Loop::printParLoopln(int n, ostream& fout)
{
for (list<Loop*>::const_iterator s = fExtraLoops.begin(); s != fExtraLoops.end(); s++) {
tab(n,fout); fout << "#pragma omp single";
tab(n,fout); fout << "{";
(*s)->println(n+1, fout);
tab(n,fout); fout << "}";
}
if (fPreCode.size()+fExecCode.size()+fPostCode.size() > 0) {
tab(n,fout); fout << "// LOOP " << this ;
if (fPreCode.size()>0) {
tab(n,fout); fout << "#pragma omp single";
tab(n,fout); fout << "{";
tab(n+1,fout); fout << "// pre processing";
printlines(n+1, fPreCode, fout);
tab(n,fout); fout << "}";
}
tab(n,fout); fout << "// exec code";
tab(n,fout); fout << "#pragma omp for";
tab(n,fout); fout << "for (int i=0; i<" << fSize << "; i++) {";
printlines(n+1, fExecCode, fout);
tab(n,fout); fout << "}";
if (fPostCode.size()>0) {
tab(n,fout); fout << "#pragma omp single";
tab(n,fout); fout << "{";
tab(n+1,fout); fout << "// post processing";
printlines(n+1, fPostCode, fout);
tab(n,fout); fout << "}";
}
tab(n,fout);
}
}
/**
* Print a single loop (unless it is empty)
* @param n number of tabs of indentation
* @param fout output stream
*/
void Loop::printoneln(int n, ostream& fout)
{
if (fPreCode.size()+fExecCode.size()+fPostCode.size() > 0) {
/* if (gVectorSwitch) {
tab(n,fout);
fout << ((fIsRecursive) ? "// recursive loop" : "// vectorizable loop");
}*/
tab(n,fout); fout << "for (int i=0; i<" << fSize << "; i++) {";
if (fPreCode.size()>0) {
tab(n+1,fout); fout << "// pre processing";
printlines(n+1, fPreCode, fout);
}
printlines(n+1, fExecCode, fout);
if (fPostCode.size()>0) {
tab(n+1,fout); fout << "// post processing";
printlines(n+1, fPostCode, fout);
}
tab(n,fout); fout << "}";
}
}
//-------------------------------------------------------
void Loop::concat(Loop* l)
{
assert(l->fUseCount == 1);
assert(fBackwardLoopDependencies.size() == 1);
assert((*fBackwardLoopDependencies.begin()) == l);
fExtraLoops.push_front(l);
fBackwardLoopDependencies = l->fBackwardLoopDependencies;
}
|
