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
|
/*
* Copyright (C) 2010 Thorsten Liebig (Thorsten.Liebig@gmx.de)
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include "operator_sse_compressed.h"
#include "engine_sse_compressed.h"
#include "engine_sse.h"
#include "tools/array_ops.h"
#include <map>
#include <cstring>
Operator_SSE_Compressed* Operator_SSE_Compressed::New()
{
cout << "Create FDTD operator (compressed SSE)" << endl;
Operator_SSE_Compressed* op = new Operator_SSE_Compressed();
op->Init();
return op;
}
Operator_SSE_Compressed::Operator_SSE_Compressed() : Operator_sse()
{
m_Op_index = NULL;
m_Use_Compression = false;
}
Operator_SSE_Compressed::~Operator_SSE_Compressed()
{
Delete();
}
Engine* Operator_SSE_Compressed::CreateEngine() const
{
if (!m_Use_Compression)
{
//! create a default sse-engine
Engine_sse* eng = Engine_sse::New(this);
return eng;
}
Engine_SSE_Compressed* eng = Engine_SSE_Compressed::New(this);
return eng;
}
int Operator_SSE_Compressed::CalcECOperator( DebugFlags debugFlags )
{
int ErrCode = Operator_sse::CalcECOperator( debugFlags );
m_Use_Compression = false;
m_Use_Compression = CompressOperator();
return ErrCode;
}
void Operator_SSE_Compressed::Init()
{
Operator_sse::Init();
m_Use_Compression = false;
m_Op_index = NULL;
}
void Operator_SSE_Compressed::Delete()
{
if (m_Op_index)
{
Delete3DArray<unsigned int>( m_Op_index, numLines );
m_Op_index = 0;
}
m_Use_Compression = false;
for (int n=0; n<3; n++)
{
f4_vv_Compressed[n].clear();
f4_vi_Compressed[n].clear();
f4_iv_Compressed[n].clear();
f4_ii_Compressed[n].clear();
}
}
void Operator_SSE_Compressed::Reset()
{
Delete();
Operator_sse::Reset();
}
void Operator_SSE_Compressed::InitOperator()
{
//cleanup compression
m_Use_Compression = false;
for (int n=0; n<3; n++)
{
f4_vv_Compressed[n].clear();
f4_vi_Compressed[n].clear();
f4_iv_Compressed[n].clear();
f4_ii_Compressed[n].clear();
}
Operator_sse::InitOperator();
m_Op_index = Create3DArray<unsigned int>( numLines );
}
void Operator_SSE_Compressed::ShowStat() const
{
Operator_sse::ShowStat();
cout << "SSE compression enabled\t: " << (m_Use_Compression?"yes":"no") << endl;
cout << "Unique SSE operators\t: " << f4_vv_Compressed->size() << endl;
cout << "-----------------------------------" << endl;
}
bool Operator_SSE_Compressed::CompressOperator()
{
if (g_settings.GetVerboseLevel()>0)
cout << "Compressing the FDTD operator... this may take a while..." << endl;
map<SSE_coeff,unsigned int> lookUpMap;
unsigned int pos[3];
for (pos[0]=0; pos[0]<numLines[0]; ++pos[0])
{
for (pos[1]=0; pos[1]<numLines[1]; ++pos[1])
{
for (pos[2]=0; pos[2]<numVectors; ++pos[2])
{
f4vector vv[3] = { f4_vv[0][pos[0]][pos[1]][pos[2]], f4_vv[1][pos[0]][pos[1]][pos[2]], f4_vv[2][pos[0]][pos[1]][pos[2]] };
f4vector vi[3] = { f4_vi[0][pos[0]][pos[1]][pos[2]], f4_vi[1][pos[0]][pos[1]][pos[2]], f4_vi[2][pos[0]][pos[1]][pos[2]] };
f4vector iv[3] = { f4_iv[0][pos[0]][pos[1]][pos[2]], f4_iv[1][pos[0]][pos[1]][pos[2]], f4_iv[2][pos[0]][pos[1]][pos[2]] };
f4vector ii[3] = { f4_ii[0][pos[0]][pos[1]][pos[2]], f4_ii[1][pos[0]][pos[1]][pos[2]], f4_ii[2][pos[0]][pos[1]][pos[2]] };
SSE_coeff c( vv, vi, iv, ii );
map<SSE_coeff,unsigned int>::iterator it;
it = lookUpMap.find(c);
if (it == lookUpMap.end())
{
// not found -> insert
unsigned int index = f4_vv_Compressed[0].size();
for (int n=0; n<3; n++)
{
f4_vv_Compressed[n].push_back( vv[n] );
f4_vi_Compressed[n].push_back( vi[n] );
f4_iv_Compressed[n].push_back( iv[n] );
f4_ii_Compressed[n].push_back( ii[n] );
}
lookUpMap[c] = index;
m_Op_index[pos[0]][pos[1]][pos[2]] = index;
}
else
{
// this operator is already in the list
unsigned int index = (*it).second;
m_Op_index[pos[0]][pos[1]][pos[2]] = index;
}
}
}
}
Delete_N_3DArray_v4sf(f4_vv,numLines);
Delete_N_3DArray_v4sf(f4_vi,numLines);
Delete_N_3DArray_v4sf(f4_iv,numLines);
Delete_N_3DArray_v4sf(f4_ii,numLines);
f4_vv = 0;
f4_vi = 0;
f4_iv = 0;
f4_ii = 0;
return true;
}
// ----------------------------------------------------------------------------
SSE_coeff::SSE_coeff( f4vector vv[3], f4vector vi[3], f4vector iv[3], f4vector ii[3] )
{
for (int n=0; n<3; n++)
{
m_vv[n] = vv[n];
m_vi[n] = vi[n];
m_iv[n] = iv[n];
m_ii[n] = ii[n];
}
}
bool SSE_coeff::operator==( const SSE_coeff& other ) const
{
for (int n=0; n<3; n++)
{
if (memcmp( &(m_vv[n]), &(other.m_vv[n]), sizeof(f4vector) ) != 0) return false;
if (memcmp( &(m_vi[n]), &(other.m_vi[n]), sizeof(f4vector) ) != 0) return false;
if (memcmp( &(m_iv[n]), &(other.m_iv[n]), sizeof(f4vector) ) != 0) return false;
if (memcmp( &(m_ii[n]), &(other.m_ii[n]), sizeof(f4vector) ) != 0) return false;
}
return true;
}
bool SSE_coeff::operator!=( const SSE_coeff& other ) const
{
return !(*this == other);
}
bool SSE_coeff::operator<( const SSE_coeff& other ) const
{
for (int n=0; n<3; n++)
{
for (int c=0; c<4; c++)
{
if (m_vv[n].f[c] > other.m_vv[n].f[c]) return false;
if (m_vv[n].f[c] < other.m_vv[n].f[c]) return true;
if (m_vi[n].f[c] > other.m_vi[n].f[c]) return false;
if (m_vi[n].f[c] < other.m_vi[n].f[c]) return true;
if (m_iv[n].f[c] > other.m_iv[n].f[c]) return false;
if (m_iv[n].f[c] < other.m_iv[n].f[c]) return true;
if (m_ii[n].f[c] > other.m_ii[n].f[c]) return false;
if (m_ii[n].f[c] < other.m_ii[n].f[c]) return true;
}
}
return false;
}
void SSE_coeff::print( ostream& stream ) const
{
stream << "SSE_coeff: (" << endl;
for (int n=0; n<3; n++)
{
stream << "n=" << n << ":" << endl;
stream << "vv=";
for (int c=0; c<4; c++)
stream << m_vv[n].f[c] << " ";
stream << endl << "vi=";
for (int c=0; c<4; c++)
stream << m_vi[n].f[c] << " ";
stream << endl << "iv=";
for (int c=0; c<4; c++)
stream << m_iv[n].f[c] << " ";
stream << endl << "ii=";
for (int c=0; c<4; c++)
stream << m_ii[n].f[c] << " ";
stream << endl;
}
stream << ")" << endl;
}
|
