Newer
Older
/***************************************************************************
ArrayOperationsMIC_impl.h - description
-------------------
begin : Mar 4, 2017
copyright : (C) 2017 by Tomas Oberhuber
email : tomas.oberhuber@fjfi.cvut.cz
***************************************************************************/
/* See Copyright Notice in tnl/Copyright */
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
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
#pragma once
#include <iostream>
#include <TNL/tnlConfig.h>
#include <TNL/Math.h>
#include <TNL/Containers/Algorithms/ArrayOperations.h>
#include <TNL/Containers/Algorithms/Reduction.h>
#include <TNL/Containers/Algorithms/reduction-operations.h>
#define MIC_STACK_VAR_LIM 5*1024*1024
namespace TNL {
namespace Containers {
namespace Algorithms {
template< typename Element, typename Index >
bool
ArrayOperations< Devices::MIC >::
allocateMemory( Element*& data,
const Index size )
{
#ifdef HAVE_MIC
data=(Element*) Devices::MIC::AllocMIC(size*sizeof(Element));
if(data)
return true;
else
return false;
#else
MICSupportMissingMessage;
return false;
#endif
}
template< typename Element >
bool
ArrayOperations< Devices::MIC >::
freeMemory( Element* data )
{
TNL_ASSERT( data, );
#ifdef HAVE_MIC
Devices::MIC::FreeMIC( data );
return true;
#else
MICSupportMissingMessage;;
true;
#endif
}
template< typename Element >
void
ArrayOperations< Devices::MIC >::
setMemoryElement( Element* data,
const Element& value )
{
TNL_ASSERT( data, );
ArrayOperations< Devices::MIC >::setMemory( data, value, 1 );
}
template< typename Element >
Element
ArrayOperations< Devices::MIC >::
getMemoryElement( const Element* data )
{
TNL_ASSERT( data, );
Element result;
ArrayOperations< Devices::Host, Devices::MIC >::copyMemory< Element, Element, int >( &result, data, 1 );
return result;
}
template< typename Element, typename Index >
Element&
ArrayOperations< Devices::MIC >::
getArrayElementReference( Element* data, const Index i )
{
TNL_ASSERT( data, );
return data[ i ];
}
template< typename Element, typename Index >
const
Element& ArrayOperations< Devices::MIC >::
getArrayElementReference( const Element* data, const Index i )
{
TNL_ASSERT( data, );
return data[ i ];
}
template< typename Element, typename Index >
bool
ArrayOperations< Devices::MIC >::
setMemory( Element* data,
const Element& value,
const Index size )
{
TNL_ASSERT( data, );
#ifdef HAVE_MIC
Element tmp=value;
Devices::MICHider<Element> hide_ptr;
hide_ptr.pointer=data;
#pragma offload target(mic) in(hide_ptr,tmp,size)
{
Element * dst= hide_ptr.pointer;
for(int i=0;i<size;i++)
dst[i]=tmp;
}
return true;
#else
MICSupportMissingMessage;;
return false;
#endif
}
template< typename DestinationElement,
typename SourceElement,
typename Index >
bool
ArrayOperations< Devices::MIC >::
copyMemory( DestinationElement* destination,
const SourceElement* source,
const Index size )
{
TNL_ASSERT( destination, );
TNL_ASSERT( source, );
#ifdef HAVE_MIC
if( std::is_same< DestinationElement, SourceElement >::value )
{
Devices::MICHider<void> src_ptr;
src_ptr.pointer=(void*)source;
Devices::MICHider<void> dst_ptr;
dst_ptr.pointer=(void*)destination;
#pragma offload target(mic) in(src_ptr,dst_ptr,size)
{
memcpy(dst_ptr.pointer,src_ptr.pointer,size*sizeof(DestinationElement));
}
return true;
}
else
{
Devices::MICHider<const SourceElement> src_ptr;
src_ptr.pointer=source;
Devices::MICHider<DestinationElement> dst_ptr;
dst_ptr.pointer=destination;
#pragma offload target(mic) in(src_ptr,dst_ptr,size)
{
for(int i=0;i<size;i++)
dst_ptr.pointer[i]=src_ptr.pointer[i];
}
return true;
}
#else
MICSupportMissingMessage;;
#endif
return false;
}
template< typename Element1,
typename Element2,
typename Index >
bool
ArrayOperations< Devices::MIC >::
compareMemory( const Element1* destination,
const Element2* source,
const Index size )
{
TNL_ASSERT( destination, );
TNL_ASSERT( source, );
#ifdef HAVE_MIC
if( std::is_same< Element1, Element2 >::value )
{
Devices::MICHider<void> src_ptr;
src_ptr.pointer=(void*)source;
Devices::MICHider<void> dst_ptr;
dst_ptr.pointer=(void*)destination;
int ret=0;
#pragma offload target(mic) in(src_ptr,dst_ptr,size) out(ret)
{
ret=memcmp(dst_ptr.pointer,src_ptr.pointer,size*sizeof(Element1));
}
if(ret==0)
return true;
}
else
{
Devices::MICHider<const Element1> src_ptr;
src_ptr.pointer=source;
Devices::MICHider<const Element2> dst_ptr;
dst_ptr.pointer=destination;
bool ret=false;
#pragma offload target(mic) in(src_ptr,dst_ptr,size) out(ret)
{
int i=0;
for(i=0;i<size;i++)
if(dst_ptr.pointer[i]!=src_ptr.pointer[i])
break;
if(i==size)
ret=true;
else
ret=false;
}
return ret;
}
#else
MICSupportMissingMessage;;
#endif
return false;
}
/****
* Operations MIC -> Host
*/
template< typename DestinationElement,
typename SourceElement,
typename Index >
bool
ArrayOperations< Devices::Host, Devices::MIC >::
copyMemory( DestinationElement* destination,
const SourceElement* source,
const Index size )
{
TNL_ASSERT( destination, );
TNL_ASSERT( source, );
#ifdef HAVE_MIC
if( std::is_same< DestinationElement, SourceElement >::value )
{
Devices::MICHider<void> src_ptr;
src_ptr.pointer=(void*)source;
//JAKA KONSTANTA se vejde do stacku 5MB?
if(size<MIC_STACK_VAR_LIM)
{
uint8_t tmp[size*sizeof(SourceElement)];
#pragma offload target(mic) in(src_ptr,size) out(tmp)
{
memcpy((void*)&tmp,src_ptr.pointer,size*sizeof(SourceElement));
}
memcpy((void*)destination,(void*)&tmp,size*sizeof(SourceElement));
return true;
}
else
{
//direct -- pomalejší
uint8_t* tmp=(uint8_t*)destination;
#pragma offload target(mic) in(src_ptr,size) out(tmp:length(size))
{
memcpy((void*)tmp,src_ptr.pointer,size*sizeof(SourceElement));
}
return true;
}
}
else
{
Devices::MICHider<const SourceElement> src_ptr;
src_ptr.pointer=source;
if(size<MIC_STACK_VAR_LIM)
{
uint8_t tmp[size*sizeof(DestinationElement)];
#pragma offload target(mic) in(src_ptr,size) out(tmp)
{
DestinationElement *dst=(DestinationElement*)&tmp;
for(int i=0;i<size;i++)
dst[i]=src_ptr.pointer[i];
}
memcpy((void*)destination,(void*)&tmp,size*sizeof(DestinationElement));
return true;
}
else
{
//direct pseudo heap-- pomalejší
uint8_t* tmp=(uint8_t*)destination;
#pragma offload target(mic) in(src_ptr,size) out(tmp:length(size*sizeof(DestinationElement)))
{
DestinationElement *dst=(DestinationElement*)tmp;
for(int i=0;i<size;i++)
dst[i]=src_ptr.pointer[i];
}
return true;
}
}
#else
MICSupportMissingMessage;;
#endif
return false;
}
template< typename Element1,
typename Element2,
typename Index >
bool
ArrayOperations< Devices::Host, Devices::MIC >::
compareMemory( const Element1* destination,
const Element2* source,
const Index size )
{
/***
* Here, destination is on host and source is on MIC device.
*/
TNL_ASSERT( destination, );
TNL_ASSERT( source, );
TNL_ASSERT( size >= 0, std::cerr << "size = " << size );
#ifdef HAVE_MIC
Index compared( 0 );
Index transfer( 0 );
Index max_transfer=MIC_STACK_VAR_LIM/sizeof(Element2);
uint8_t host_buffer[max_transfer*sizeof(Element2)];
Devices::MICHider<const Element2> src_ptr;
while( compared < size )
{
transfer=min(size-compared,max_transfer);
src_ptr.pointer=source+compared;
#pragma offload target(mic) out(host_buffer) in(src_ptr,transfer)
{
memcpy((void*)&host_buffer,(void*)src_ptr.pointer,transfer*sizeof(Element2));
}
if( ! ArrayOperations< Devices::Host >::compareMemory( &destination[ compared ], (Element2*)&host_buffer, transfer ) )
{
return false;
}
compared += transfer;
}
return true;
#else
MICSupportMissingMessage;
return false;
#endif
}
/****
* Operations Host -> MIC
*/
template< typename DestinationElement,
typename SourceElement,
typename Index >
bool
ArrayOperations< Devices::MIC, Devices::Host >::
copyMemory( DestinationElement* destination,
const SourceElement* source,
const Index size )
{
TNL_ASSERT( destination, );
TNL_ASSERT( source, );
TNL_ASSERT( size >= 0, std::cerr << "size = " << size );
#ifdef HAVE_MIC
if( std::is_same< DestinationElement, SourceElement >::value )
{
Devices::MICHider<void> dst_ptr;
dst_ptr.pointer=(void*)destination;
//JAKA KONSTANTA se vejde do stacku 5MB?
if(size<MIC_STACK_VAR_LIM)
{
uint8_t tmp[size*sizeof(SourceElement)];
memcpy((void*)&tmp,(void*)source,size*sizeof(SourceElement));
#pragma offload target(mic) in(dst_ptr,tmp,size)
{
memcpy(dst_ptr.pointer,(void*)&tmp,size*sizeof(SourceElement));
}
return true;
}
else
{
//direct pseudo heap-- pomalejší
uint8_t* tmp=(uint8_t*)source;
#pragma offload target(mic) in(dst_ptr,size) in(tmp:length(size))
{
memcpy(dst_ptr.pointer,(void*)tmp,size*sizeof(SourceElement));
}
return true;
}
}
else
{
Devices::MICHider<DestinationElement> dst_ptr;
dst_ptr.pointer=destination;
if(size<MIC_STACK_VAR_LIM)
{
uint8_t tmp[size*sizeof(SourceElement)];
memcpy((void*)&tmp,(void*)source,size*sizeof(SourceElement));
#pragma offload target(mic) in(dst_ptr,size,tmp)
{
SourceElement *src=(SourceElement*)&tmp;
for(int i=0;i<size;i++)
dst_ptr.pointer[i]=src[i];
}
return true;
}
else
{
//direct pseudo heap-- pomalejší
uint8_t* tmp=(uint8_t*)source;
#pragma offload target(mic) in(dst_ptr,size) in(tmp:length(size*sizeof(SourceElement)))
{
SourceElement *src=(SourceElement*)tmp;
for(int i=0;i<size;i++)
dst_ptr.pointer[i]=src[i];
}
return true;
}
}
#else
MICSupportMissingMessage;;
#endif
return false;
}
template< typename Element1,
typename Element2,
typename Index >
bool
ArrayOperations< Devices::MIC, Devices::Host >::
compareMemory( const Element1* hostData,
const Element2* deviceData,
const Index size )
{
TNL_ASSERT( hostData, );
TNL_ASSERT( deviceData, );
TNL_ASSERT( size >= 0, std::cerr << "size = " << size );
return ArrayOperations< Devices::Host, Devices::MIC >::compareMemory( deviceData, hostData, size );
}
} // namespace Algorithms
} // namespace Containers
} // namespace TNL